./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.16.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.16.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45519c8273c53879cf6a170ed74d5bc0be814b1f3243ce6c30d1d3efe9a3cf32 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:13:55,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:13:55,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:13:55,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:13:55,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:13:55,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:13:55,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:13:55,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:13:55,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:13:55,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:13:55,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:13:55,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:13:55,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:13:55,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:13:55,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:13:55,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:13:55,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:13:55,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45519c8273c53879cf6a170ed74d5bc0be814b1f3243ce6c30d1d3efe9a3cf32 [2025-02-07 21:13:56,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:13:56,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:13:56,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:13:56,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:13:56,174 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:13:56,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.16.cil.c [2025-02-07 21:13:57,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9012c0988/5c04ae43dda64d789e439d345a305a64/FLAGdbd5f9bb3 [2025-02-07 21:13:57,718 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:13:57,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.16.cil.c [2025-02-07 21:13:57,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9012c0988/5c04ae43dda64d789e439d345a305a64/FLAGdbd5f9bb3 [2025-02-07 21:13:57,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9012c0988/5c04ae43dda64d789e439d345a305a64 [2025-02-07 21:13:57,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:13:57,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:13:57,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:13:57,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:13:57,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:13:57,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:13:57" (1/1) ... [2025-02-07 21:13:57,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5597776f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:57, skipping insertion in model container [2025-02-07 21:13:57,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:13:57" (1/1) ... [2025-02-07 21:13:58,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:13:58,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.16.cil.c[706,719] [2025-02-07 21:13:58,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:13:58,310 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:13:58,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.16.cil.c[706,719] [2025-02-07 21:13:58,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:13:58,372 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:13:58,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58 WrapperNode [2025-02-07 21:13:58,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:13:58,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:13:58,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:13:58,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:13:58,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,409 INFO L138 Inliner]: procedures = 56, calls = 71, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 920 [2025-02-07 21:13:58,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:13:58,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:13:58,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:13:58,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:13:58,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:13:58,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:13:58,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:13:58,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:13:58,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:13:58,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (1/1) ... [2025-02-07 21:13:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:13:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:58,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:13:58,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:13:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:13:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-07 21:13:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-07 21:13:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-07 21:13:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-07 21:13:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-07 21:13:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-07 21:13:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-07 21:13:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-07 21:13:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-07 21:13:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-07 21:13:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-07 21:13:58,515 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-07 21:13:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:13:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:13:58,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:13:58,593 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:13:58,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:13:59,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1951: assume 1 == ~E_14~0;~E_14~0 := 2; [2025-02-07 21:13:59,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1951: assume !(1 == ~E_14~0); [2025-02-07 21:13:59,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L250: ~E_4~0 := 2; [2025-02-07 21:13:59,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L250-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: ~E_13~0 := 1; [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034: assume -2147483648 <= start_simulation_#t~ret36#1 && start_simulation_#t~ret36#1 <= 2147483647;start_simulation_~tmp~3#1 := start_simulation_#t~ret36#1;havoc start_simulation_#t~ret36#1; [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034-1: SUMMARY for call start_simulation_#t~ret36#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: assume 1 == ~T5_E~0;~T5_E~0 := 2; [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: assume !(1 == ~T5_E~0); [2025-02-07 21:13:59,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1126: assume { :end_inline_master } true; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: assume 1 == ~E_1~0;~E_1~0 := 2; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: assume !(1 == ~E_1~0); [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1308: assume { :end_inline_transmit13 } true; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: ~E_5~0 := 1; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1143: assume { :end_inline_error } true; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: ~E_13~0 := 2; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936: assume 1 == ~E_11~0;~E_11~0 := 2; [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936: assume !(1 == ~E_11~0); [2025-02-07 21:13:59,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1821: assume 1 == ~T2_E~0;~T2_E~0 := 2; [2025-02-07 21:13:59,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1821: assume !(1 == ~T2_E~0); [2025-02-07 21:13:59,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: ~E_5~0 := 2; [2025-02-07 21:13:59,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: assume { :end_inline_transmit6 } true; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036: assume 0 == start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 4;assume { :begin_inline_fire_time_events } true;~M_E~0 := 1; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036: assume !(0 == start_simulation_~tmp~3#1); [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871: assume 1 == ~T12_E~0;~T12_E~0 := 2; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871: assume !(1 == ~T12_E~0); [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: assume 1 == ~E_8~0;~E_8~0 := 2; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: assume !(1 == ~E_8~0); [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: ~E_6~0 := 1; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1294: assume { :end_inline_transmit12 } true; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021: havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet9#1, eval_~tmp_ndt_5~0#1, eval_#t~nondet10#1, eval_~tmp_ndt_6~0#1, eval_#t~nondet11#1, eval_~tmp_ndt_7~0#1, eval_#t~nondet12#1, eval_~tmp_ndt_8~0#1, eval_#t~nondet13#1, eval_~tmp_ndt_9~0#1, eval_#t~nondet14#1, eval_~tmp_ndt_10~0#1, eval_#t~nondet15#1, eval_~tmp_ndt_11~0#1, eval_#t~nondet16#1, eval_~tmp_ndt_12~0#1, eval_#t~nondet17#1, eval_~tmp_ndt_13~0#1, eval_#t~nondet18#1, eval_~tmp_ndt_14~0#1, eval_#t~nondet19#1, eval_~tmp_ndt_15~0#1, eval_~tmp~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: assume 1 == ~T9_E~0;~T9_E~0 := 2; [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: assume !(1 == ~T9_E~0); [2025-02-07 21:13:59,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: ~E_6~0 := 2; [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1906: assume 1 == ~E_5~0;~E_5~0 := 2; [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1906: assume !(1 == ~E_5~0); [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1196: assume { :end_inline_transmit5 } true; [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: assume -2147483648 <= stop_simulation_#t~ret35#1 && stop_simulation_#t~ret35#1 <= 2147483647;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret35#1;havoc stop_simulation_#t~ret35#1; [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-1: SUMMARY for call stop_simulation_#t~ret35#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: ~E_7~0 := 1; [2025-02-07 21:13:59,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: assume { :end_inline_fire_time_events } true; [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841: assume 1 == ~T6_E~0;~T6_E~0 := 2; [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841: assume !(1 == ~T6_E~0); [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891: assume 1 == ~E_2~0;~E_2~0 := 2; [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891: assume !(1 == ~E_2~0); [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L355: ~E_7~0 := 2; [2025-02-07 21:13:59,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L355-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: assume { :end_inline_transmit11 } true; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2040: assume { :begin_inline_reset_time_events } true; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2040-1: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1941: assume 1 == ~E_12~0;~E_12~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1941: assume !(1 == ~E_12~0); [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: ~E_8~0 := 1; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: assume 1 == ~T3_E~0;~T3_E~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: assume !(1 == ~T3_E~0); [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: assume { :end_inline_transmit4 } true; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: assume { :end_inline_reset_time_events } true; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876: assume 1 == ~T13_E~0;~T13_E~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876: assume !(1 == ~T13_E~0); [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: start_simulation_~kernel_st~0#1 := 3; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926: assume 1 == ~E_9~0;~E_9~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926: assume !(1 == ~E_9~0); [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: ~E_8~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L390-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: assume 1 == ~M_E~0;~M_E~0 := 2; [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: assume !(1 == ~M_E~0); [2025-02-07 21:13:59,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: assume { :end_inline_transmit10 } true; [2025-02-07 21:13:59,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134: havoc eval_~tmp_ndt_2~0#1; [2025-02-07 21:13:59,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: ~E_9~0 := 1; [2025-02-07 21:13:59,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861: assume 1 == ~T10_E~0;~T10_E~0 := 2; [2025-02-07 21:13:59,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861: assume !(1 == ~T10_E~0); [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: assume 1 == ~E_6~0;~E_6~0 := 2; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: assume !(1 == ~E_6~0); [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168: assume { :end_inline_transmit3 } true; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: ~E_9~0 := 2; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L425-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: assume 1 == ~T7_E~0;~T7_E~0 := 2; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: assume !(1 == ~T7_E~0); [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: ~E_10~0 := 1; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: assume 1 == ~E_3~0;~E_3~0 := 2; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: assume !(1 == ~E_3~0); [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252: assume { :end_inline_transmit9 } true; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: assume 1 == ~E_13~0;~E_13~0 := 2; [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: assume !(1 == ~E_13~0); [2025-02-07 21:13:59,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: ~E_2~0 := 1; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2029: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: ~E_10~0 := 2; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L460-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831: assume 1 == ~T4_E~0;~T4_E~0 := 2; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831: assume !(1 == ~T4_E~0); [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: assume { :end_inline_transmit2 } true; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: assume 1 == ~T14_E~0;~T14_E~0 := 2; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: assume !(1 == ~T14_E~0); [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: ~E_2~0 := 2; [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L180-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:13:59,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: ~E_11~0 := 1; [2025-02-07 21:13:59,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931: assume 1 == ~E_10~0;~E_10~0 := 2; [2025-02-07 21:13:59,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931: assume !(1 == ~E_10~0); [2025-02-07 21:13:59,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2047: start_simulation_#t~ret37#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret35#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;assume -2147483648 <= start_simulation_#t~ret37#1 && start_simulation_#t~ret37#1 <= 2147483647;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret37#1;havoc start_simulation_#t~ret37#1; [2025-02-07 21:13:59,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2047-1: assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret35#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1; [2025-02-07 21:13:59,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: assume 1 == ~T1_E~0;~T1_E~0 := 2; [2025-02-07 21:13:59,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: assume !(1 == ~T1_E~0); [2025-02-07 21:13:59,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: assume { :end_inline_transmit8 } true; [2025-02-07 21:13:59,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: ~E_3~0 := 1; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2031: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: ~E_11~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L495-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: assume 1 == ~T11_E~0;~T11_E~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: assume !(1 == ~T11_E~0); [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916: assume 1 == ~E_7~0;~E_7~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916: assume !(1 == ~E_7~0); [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L215: ~E_3~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L215-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1140: assume { :end_inline_transmit1 } true; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: ~E_12~0 := 1; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1322: assume { :end_inline_transmit14 } true; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2049: assume 0 != start_simulation_~tmp___0~1#1; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2049: assume !(0 != start_simulation_~tmp___0~1#1); [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1851: assume 1 == ~T8_E~0;~T8_E~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1851: assume !(1 == ~T8_E~0); [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: ~E_4~0 := 1; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: ~E_12~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L530-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: assume 1 == ~E_4~0;~E_4~0 := 2; [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: assume !(1 == ~E_4~0); [2025-02-07 21:13:59,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1224: assume { :end_inline_transmit7 } true; [2025-02-07 21:13:59,299 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-02-07 21:13:59,299 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:13:59,309 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:13:59,309 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:13:59,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:13:59 BoogieIcfgContainer [2025-02-07 21:13:59,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:13:59,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:13:59,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:13:59,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:13:59,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:13:57" (1/3) ... [2025-02-07 21:13:59,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c15c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:13:59, skipping insertion in model container [2025-02-07 21:13:59,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:58" (2/3) ... [2025-02-07 21:13:59,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c15c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:13:59, skipping insertion in model container [2025-02-07 21:13:59,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:13:59" (3/3) ... [2025-02-07 21:13:59,315 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.16.cil.c [2025-02-07 21:13:59,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:13:59,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.16.cil.c that has 7 procedures, 364 locations, 1 initial locations, 18 loop locations, and 1 error locations. [2025-02-07 21:13:59,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:13:59,374 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;@1f28cec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:13:59,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:13:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 270 states have (on average 1.788888888888889) internal successors, (483), 350 states have internal predecessors, (483), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 21:13:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:13:59,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:59,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:59,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1655440601, now seen corresponding path program 1 times [2025-02-07 21:13:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:59,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726543612] [2025-02-07 21:13:59,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:59,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:13:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:13:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:59,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726543612] [2025-02-07 21:13:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726543612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:59,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:59,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:13:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118000353] [2025-02-07 21:13:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:13:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:59,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:13:59,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:13:59,718 INFO L87 Difference]: Start difference. First operand has 364 states, 270 states have (on average 1.788888888888889) internal successors, (483), 350 states have internal predecessors, (483), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:59,781 INFO L93 Difference]: Finished difference Result 703 states and 986 transitions. [2025-02-07 21:13:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:13:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:13:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:59,787 INFO L225 Difference]: With dead ends: 703 [2025-02-07 21:13:59,787 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:13:59,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:13:59,791 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:59,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:13:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:13:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:13:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.5294117647058822) internal successors, (338), 221 states have internal predecessors, (338), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2025-02-07 21:13:59,831 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 175 [2025-02-07 21:13:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:59,831 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2025-02-07 21:13:59,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2025-02-07 21:13:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:13:59,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:59,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:13:59,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash -903891448, now seen corresponding path program 1 times [2025-02-07 21:13:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397598023] [2025-02-07 21:13:59,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:59,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:13:59,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:13:59,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397598023] [2025-02-07 21:14:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397598023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464480099] [2025-02-07 21:14:00,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:00,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:00,033 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:00,055 INFO L93 Difference]: Finished difference Result 450 states and 674 transitions. [2025-02-07 21:14:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:00,057 INFO L225 Difference]: With dead ends: 450 [2025-02-07 21:14:00,057 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:00,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:00,058 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:00,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.5248868778280542) internal successors, (337), 221 states have internal predecessors, (337), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 347 transitions. [2025-02-07 21:14:00,075 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 347 transitions. Word has length 175 [2025-02-07 21:14:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:00,076 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 347 transitions. [2025-02-07 21:14:00,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 347 transitions. [2025-02-07 21:14:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:00,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:00,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:00,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:14:00,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1189027351, now seen corresponding path program 1 times [2025-02-07 21:14:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852608649] [2025-02-07 21:14:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:00,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:00,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:00,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:00,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852608649] [2025-02-07 21:14:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852608649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816212861] [2025-02-07 21:14:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:00,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:00,346 INFO L87 Difference]: Start difference. First operand 232 states and 347 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:00,586 INFO L93 Difference]: Finished difference Result 441 states and 658 transitions. [2025-02-07 21:14:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:00,590 INFO L225 Difference]: With dead ends: 441 [2025-02-07 21:14:00,590 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:00,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:00,591 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 562 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:00,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 517 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.5158371040723981) internal successors, (335), 221 states have internal predecessors, (335), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 345 transitions. [2025-02-07 21:14:00,605 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 345 transitions. Word has length 175 [2025-02-07 21:14:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 345 transitions. [2025-02-07 21:14:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 345 transitions. [2025-02-07 21:14:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:00,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:00,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:00,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:14:00,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1891623190, now seen corresponding path program 1 times [2025-02-07 21:14:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273048998] [2025-02-07 21:14:00,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:00,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273048998] [2025-02-07 21:14:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273048998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328125947] [2025-02-07 21:14:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:00,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:00,815 INFO L87 Difference]: Start difference. First operand 232 states and 345 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,038 INFO L93 Difference]: Finished difference Result 469 states and 708 transitions. [2025-02-07 21:14:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,041 INFO L225 Difference]: With dead ends: 469 [2025-02-07 21:14:01,041 INFO L226 Difference]: Without dead ends: 261 [2025-02-07 21:14:01,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:01,042 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 558 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 680 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-07 21:14:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 232. [2025-02-07 21:14:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.51131221719457) internal successors, (334), 221 states have internal predecessors, (334), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 344 transitions. [2025-02-07 21:14:01,062 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 344 transitions. Word has length 175 [2025-02-07 21:14:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 344 transitions. [2025-02-07 21:14:01,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 344 transitions. [2025-02-07 21:14:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:01,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:14:01,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -944456247, now seen corresponding path program 1 times [2025-02-07 21:14:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18944621] [2025-02-07 21:14:01,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:01,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:01,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:01,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18944621] [2025-02-07 21:14:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18944621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:01,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147182301] [2025-02-07 21:14:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:01,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:01,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:01,236 INFO L87 Difference]: Start difference. First operand 232 states and 344 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,526 INFO L93 Difference]: Finished difference Result 536 states and 786 transitions. [2025-02-07 21:14:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,528 INFO L225 Difference]: With dead ends: 536 [2025-02-07 21:14:01,529 INFO L226 Difference]: Without dead ends: 329 [2025-02-07 21:14:01,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:01,530 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 610 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1249 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-07 21:14:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 232. [2025-02-07 21:14:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.506787330316742) internal successors, (333), 221 states have internal predecessors, (333), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 343 transitions. [2025-02-07 21:14:01,549 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 343 transitions. Word has length 175 [2025-02-07 21:14:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,549 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 343 transitions. [2025-02-07 21:14:01,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2025-02-07 21:14:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:01,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:01,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:14:01,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -221165814, now seen corresponding path program 1 times [2025-02-07 21:14:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221242630] [2025-02-07 21:14:01,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:01,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:01,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:01,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:01,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221242630] [2025-02-07 21:14:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221242630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537555121] [2025-02-07 21:14:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:01,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:01,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:01,720 INFO L87 Difference]: Start difference. First operand 232 states and 343 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,982 INFO L93 Difference]: Finished difference Result 534 states and 781 transitions. [2025-02-07 21:14:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,983 INFO L225 Difference]: With dead ends: 534 [2025-02-07 21:14:01,985 INFO L226 Difference]: Without dead ends: 328 [2025-02-07 21:14:01,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:01,986 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 606 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1237 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-07 21:14:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 232. [2025-02-07 21:14:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.502262443438914) internal successors, (332), 221 states have internal predecessors, (332), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2025-02-07 21:14:01,997 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 175 [2025-02-07 21:14:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,997 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2025-02-07 21:14:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2025-02-07 21:14:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:01,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:01,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:14:01,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1464734121, now seen corresponding path program 1 times [2025-02-07 21:14:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019866560] [2025-02-07 21:14:02,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019866560] [2025-02-07 21:14:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019866560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890159999] [2025-02-07 21:14:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:02,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:02,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:02,156 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:02,422 INFO L93 Difference]: Finished difference Result 532 states and 776 transitions. [2025-02-07 21:14:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:02,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:02,424 INFO L225 Difference]: With dead ends: 532 [2025-02-07 21:14:02,425 INFO L226 Difference]: Without dead ends: 327 [2025-02-07 21:14:02,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:02,425 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 602 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:02,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1225 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-07 21:14:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 232. [2025-02-07 21:14:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.497737556561086) internal successors, (331), 221 states have internal predecessors, (331), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-02-07 21:14:02,441 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 175 [2025-02-07 21:14:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:02,445 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-02-07 21:14:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-02-07 21:14:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:02,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:14:02,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:02,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1657665322, now seen corresponding path program 1 times [2025-02-07 21:14:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488239158] [2025-02-07 21:14:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:02,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:02,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488239158] [2025-02-07 21:14:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488239158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376094992] [2025-02-07 21:14:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:02,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:02,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:02,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:02,674 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:02,939 INFO L93 Difference]: Finished difference Result 530 states and 771 transitions. [2025-02-07 21:14:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:02,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:02,941 INFO L225 Difference]: With dead ends: 530 [2025-02-07 21:14:02,941 INFO L226 Difference]: Without dead ends: 326 [2025-02-07 21:14:02,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:02,942 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 598 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:02,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1213 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-07 21:14:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 232. [2025-02-07 21:14:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.493212669683258) internal successors, (330), 221 states have internal predecessors, (330), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 340 transitions. [2025-02-07 21:14:02,951 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 340 transitions. Word has length 175 [2025-02-07 21:14:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 340 transitions. [2025-02-07 21:14:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 340 transitions. [2025-02-07 21:14:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:02,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:02,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:02,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:14:02,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:02,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1525341577, now seen corresponding path program 1 times [2025-02-07 21:14:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906286077] [2025-02-07 21:14:02,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:02,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:02,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906286077] [2025-02-07 21:14:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906286077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368777024] [2025-02-07 21:14:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:03,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:03,091 INFO L87 Difference]: Start difference. First operand 232 states and 340 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,368 INFO L93 Difference]: Finished difference Result 528 states and 766 transitions. [2025-02-07 21:14:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,370 INFO L225 Difference]: With dead ends: 528 [2025-02-07 21:14:03,370 INFO L226 Difference]: Without dead ends: 325 [2025-02-07 21:14:03,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:03,371 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 594 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1201 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-07 21:14:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 232. [2025-02-07 21:14:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.48868778280543) internal successors, (329), 221 states have internal predecessors, (329), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 339 transitions. [2025-02-07 21:14:03,381 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 339 transitions. Word has length 175 [2025-02-07 21:14:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,382 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 339 transitions. [2025-02-07 21:14:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 339 transitions. [2025-02-07 21:14:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:03,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:03,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:14:03,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1804062902, now seen corresponding path program 1 times [2025-02-07 21:14:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930945142] [2025-02-07 21:14:03,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:03,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:03,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930945142] [2025-02-07 21:14:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930945142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842876248] [2025-02-07 21:14:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:03,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:03,486 INFO L87 Difference]: Start difference. First operand 232 states and 339 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,657 INFO L93 Difference]: Finished difference Result 457 states and 678 transitions. [2025-02-07 21:14:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:03,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,659 INFO L225 Difference]: With dead ends: 457 [2025-02-07 21:14:03,659 INFO L226 Difference]: Without dead ends: 255 [2025-02-07 21:14:03,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:03,660 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 540 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 632 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-07 21:14:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2025-02-07 21:14:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4841628959276019) internal successors, (328), 221 states have internal predecessors, (328), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 338 transitions. [2025-02-07 21:14:03,670 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 338 transitions. Word has length 175 [2025-02-07 21:14:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,670 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 338 transitions. [2025-02-07 21:14:03,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2025-02-07 21:14:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:03,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:03,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:14:03,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1829314921, now seen corresponding path program 1 times [2025-02-07 21:14:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096783139] [2025-02-07 21:14:03,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:03,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:03,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096783139] [2025-02-07 21:14:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096783139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942941502] [2025-02-07 21:14:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:03,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:03,758 INFO L87 Difference]: Start difference. First operand 232 states and 338 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,924 INFO L93 Difference]: Finished difference Result 455 states and 673 transitions. [2025-02-07 21:14:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,926 INFO L225 Difference]: With dead ends: 455 [2025-02-07 21:14:03,926 INFO L226 Difference]: Without dead ends: 254 [2025-02-07 21:14:03,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:03,927 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 578 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 540 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-07 21:14:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2025-02-07 21:14:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4796380090497738) internal successors, (327), 221 states have internal predecessors, (327), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 337 transitions. [2025-02-07 21:14:03,936 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 337 transitions. Word has length 175 [2025-02-07 21:14:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,936 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 337 transitions. [2025-02-07 21:14:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2025-02-07 21:14:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:03,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:03,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:14:03,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1517162646, now seen corresponding path program 1 times [2025-02-07 21:14:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870126913] [2025-02-07 21:14:03,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:03,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870126913] [2025-02-07 21:14:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870126913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:04,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367811005] [2025-02-07 21:14:04,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:04,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:04,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:04,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:04,133 INFO L87 Difference]: Start difference. First operand 232 states and 337 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,541 INFO L93 Difference]: Finished difference Result 522 states and 751 transitions. [2025-02-07 21:14:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,545 INFO L225 Difference]: With dead ends: 522 [2025-02-07 21:14:04,545 INFO L226 Difference]: Without dead ends: 322 [2025-02-07 21:14:04,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:04,549 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 582 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1165 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:14:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-07 21:14:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2025-02-07 21:14:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 336 transitions. [2025-02-07 21:14:04,568 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 336 transitions. Word has length 175 [2025-02-07 21:14:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,569 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 336 transitions. [2025-02-07 21:14:04,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 336 transitions. [2025-02-07 21:14:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:04,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:04,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:14:04,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1348018871, now seen corresponding path program 1 times [2025-02-07 21:14:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182131674] [2025-02-07 21:14:04,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:04,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182131674] [2025-02-07 21:14:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182131674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:04,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:04,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:04,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585238087] [2025-02-07 21:14:04,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:04,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:04,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:04,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:04,739 INFO L87 Difference]: Start difference. First operand 232 states and 336 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,928 INFO L93 Difference]: Finished difference Result 451 states and 663 transitions. [2025-02-07 21:14:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,929 INFO L225 Difference]: With dead ends: 451 [2025-02-07 21:14:04,929 INFO L226 Difference]: Without dead ends: 252 [2025-02-07 21:14:04,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:04,930 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 531 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 608 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-07 21:14:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2025-02-07 21:14:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4705882352941178) internal successors, (325), 221 states have internal predecessors, (325), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 335 transitions. [2025-02-07 21:14:04,940 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 335 transitions. Word has length 175 [2025-02-07 21:14:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 335 transitions. [2025-02-07 21:14:04,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 335 transitions. [2025-02-07 21:14:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:04,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:14:04,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1012742026, now seen corresponding path program 1 times [2025-02-07 21:14:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33968167] [2025-02-07 21:14:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:04,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:04,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33968167] [2025-02-07 21:14:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33968167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54579986] [2025-02-07 21:14:05,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:05,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:05,042 INFO L87 Difference]: Start difference. First operand 232 states and 335 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,240 INFO L93 Difference]: Finished difference Result 449 states and 658 transitions. [2025-02-07 21:14:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,242 INFO L225 Difference]: With dead ends: 449 [2025-02-07 21:14:05,242 INFO L226 Difference]: Without dead ends: 251 [2025-02-07 21:14:05,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:05,242 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 528 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 600 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-07 21:14:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 232. [2025-02-07 21:14:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4660633484162895) internal successors, (324), 221 states have internal predecessors, (324), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2025-02-07 21:14:05,257 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 175 [2025-02-07 21:14:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,258 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2025-02-07 21:14:05,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2025-02-07 21:14:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:05,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:14:05,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1404956375, now seen corresponding path program 1 times [2025-02-07 21:14:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776367466] [2025-02-07 21:14:05,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:05,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:05,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:05,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776367466] [2025-02-07 21:14:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776367466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141580131] [2025-02-07 21:14:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:05,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:05,357 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,561 INFO L93 Difference]: Finished difference Result 447 states and 653 transitions. [2025-02-07 21:14:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,563 INFO L225 Difference]: With dead ends: 447 [2025-02-07 21:14:05,563 INFO L226 Difference]: Without dead ends: 250 [2025-02-07 21:14:05,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:05,564 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 525 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 592 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-07 21:14:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 232. [2025-02-07 21:14:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4615384615384615) internal successors, (323), 221 states have internal predecessors, (323), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 333 transitions. [2025-02-07 21:14:05,577 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 333 transitions. Word has length 175 [2025-02-07 21:14:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,577 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 333 transitions. [2025-02-07 21:14:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 333 transitions. [2025-02-07 21:14:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:05,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:05,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:14:05,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1482946646, now seen corresponding path program 1 times [2025-02-07 21:14:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169057072] [2025-02-07 21:14:05,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:05,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:05,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:05,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169057072] [2025-02-07 21:14:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169057072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207073500] [2025-02-07 21:14:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:05,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:05,702 INFO L87 Difference]: Start difference. First operand 232 states and 333 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:06,081 INFO L93 Difference]: Finished difference Result 514 states and 731 transitions. [2025-02-07 21:14:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:06,083 INFO L225 Difference]: With dead ends: 514 [2025-02-07 21:14:06,083 INFO L226 Difference]: Without dead ends: 318 [2025-02-07 21:14:06,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:06,084 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 566 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:06,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1117 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:14:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-07 21:14:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2025-02-07 21:14:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4570135746606334) internal successors, (322), 221 states have internal predecessors, (322), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2025-02-07 21:14:06,095 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 175 [2025-02-07 21:14:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:06,095 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2025-02-07 21:14:06,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2025-02-07 21:14:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:06,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:06,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:06,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:14:06,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:06,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 869842185, now seen corresponding path program 1 times [2025-02-07 21:14:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:06,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160162560] [2025-02-07 21:14:06,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:06,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:06,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:06,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:06,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160162560] [2025-02-07 21:14:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160162560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29280660] [2025-02-07 21:14:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:06,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:06,192 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:06,797 INFO L93 Difference]: Finished difference Result 512 states and 726 transitions. [2025-02-07 21:14:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:06,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:06,803 INFO L225 Difference]: With dead ends: 512 [2025-02-07 21:14:06,803 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 21:14:06,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:06,804 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 562 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:06,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1105 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:14:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 21:14:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 232. [2025-02-07 21:14:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4524886877828054) internal successors, (321), 221 states have internal predecessors, (321), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 331 transitions. [2025-02-07 21:14:06,825 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 331 transitions. Word has length 175 [2025-02-07 21:14:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:06,825 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 331 transitions. [2025-02-07 21:14:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 331 transitions. [2025-02-07 21:14:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:06,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:14:06,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -24092726, now seen corresponding path program 1 times [2025-02-07 21:14:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955256346] [2025-02-07 21:14:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:06,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:06,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:06,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:06,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955256346] [2025-02-07 21:14:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955256346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353897068] [2025-02-07 21:14:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:06,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:06,921 INFO L87 Difference]: Start difference. First operand 232 states and 331 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,116 INFO L93 Difference]: Finished difference Result 441 states and 638 transitions. [2025-02-07 21:14:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:07,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,118 INFO L225 Difference]: With dead ends: 441 [2025-02-07 21:14:07,118 INFO L226 Difference]: Without dead ends: 247 [2025-02-07 21:14:07,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:07,119 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 516 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 568 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-07 21:14:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2025-02-07 21:14:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4479638009049773) internal successors, (320), 221 states have internal predecessors, (320), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 330 transitions. [2025-02-07 21:14:07,130 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 330 transitions. Word has length 175 [2025-02-07 21:14:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 330 transitions. [2025-02-07 21:14:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2025-02-07 21:14:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:07,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:07,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:14:07,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1055449321, now seen corresponding path program 1 times [2025-02-07 21:14:07,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582502849] [2025-02-07 21:14:07,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:07,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:07,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582502849] [2025-02-07 21:14:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582502849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741554019] [2025-02-07 21:14:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:07,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:07,245 INFO L87 Difference]: Start difference. First operand 232 states and 330 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,489 INFO L93 Difference]: Finished difference Result 508 states and 716 transitions. [2025-02-07 21:14:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,490 INFO L225 Difference]: With dead ends: 508 [2025-02-07 21:14:07,490 INFO L226 Difference]: Without dead ends: 315 [2025-02-07 21:14:07,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:07,491 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 571 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 744 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-07 21:14:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 232. [2025-02-07 21:14:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4434389140271493) internal successors, (319), 221 states have internal predecessors, (319), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 329 transitions. [2025-02-07 21:14:07,501 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 329 transitions. Word has length 175 [2025-02-07 21:14:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,502 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 329 transitions. [2025-02-07 21:14:07,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 329 transitions. [2025-02-07 21:14:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:07,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:14:07,503 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1090273258, now seen corresponding path program 1 times [2025-02-07 21:14:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506467645] [2025-02-07 21:14:07,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:07,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:07,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506467645] [2025-02-07 21:14:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506467645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842840986] [2025-02-07 21:14:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:07,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:07,577 INFO L87 Difference]: Start difference. First operand 232 states and 329 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,742 INFO L93 Difference]: Finished difference Result 437 states and 628 transitions. [2025-02-07 21:14:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,743 INFO L225 Difference]: With dead ends: 437 [2025-02-07 21:14:07,744 INFO L226 Difference]: Without dead ends: 245 [2025-02-07 21:14:07,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:07,745 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 510 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 552 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-07 21:14:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 232. [2025-02-07 21:14:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4389140271493213) internal successors, (318), 221 states have internal predecessors, (318), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 328 transitions. [2025-02-07 21:14:07,768 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 328 transitions. Word has length 175 [2025-02-07 21:14:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,768 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 328 transitions. [2025-02-07 21:14:07,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 328 transitions. [2025-02-07 21:14:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:07,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:07,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 21:14:07,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -848266039, now seen corresponding path program 1 times [2025-02-07 21:14:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951645317] [2025-02-07 21:14:07,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:07,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:07,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951645317] [2025-02-07 21:14:07,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951645317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25737424] [2025-02-07 21:14:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:07,870 INFO L87 Difference]: Start difference. First operand 232 states and 328 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,046 INFO L93 Difference]: Finished difference Result 435 states and 623 transitions. [2025-02-07 21:14:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,047 INFO L225 Difference]: With dead ends: 435 [2025-02-07 21:14:08,047 INFO L226 Difference]: Without dead ends: 244 [2025-02-07 21:14:08,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:08,048 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 507 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 544 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-07 21:14:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2025-02-07 21:14:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4343891402714932) internal successors, (317), 221 states have internal predecessors, (317), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 327 transitions. [2025-02-07 21:14:08,058 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 327 transitions. Word has length 175 [2025-02-07 21:14:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,058 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 327 transitions. [2025-02-07 21:14:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 327 transitions. [2025-02-07 21:14:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:08,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:08,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 21:14:08,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1998694410, now seen corresponding path program 1 times [2025-02-07 21:14:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434046745] [2025-02-07 21:14:08,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434046745] [2025-02-07 21:14:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434046745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094163419] [2025-02-07 21:14:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:08,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:08,145 INFO L87 Difference]: Start difference. First operand 232 states and 327 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,407 INFO L93 Difference]: Finished difference Result 502 states and 701 transitions. [2025-02-07 21:14:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,411 INFO L225 Difference]: With dead ends: 502 [2025-02-07 21:14:08,411 INFO L226 Difference]: Without dead ends: 312 [2025-02-07 21:14:08,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:08,412 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 542 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1045 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-07 21:14:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 232. [2025-02-07 21:14:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4298642533936652) internal successors, (316), 221 states have internal predecessors, (316), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2025-02-07 21:14:08,423 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 175 [2025-02-07 21:14:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2025-02-07 21:14:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2025-02-07 21:14:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:08,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:08,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 21:14:08,426 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -957509463, now seen corresponding path program 1 times [2025-02-07 21:14:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130077591] [2025-02-07 21:14:08,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130077591] [2025-02-07 21:14:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130077591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616062621] [2025-02-07 21:14:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:08,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:08,502 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,663 INFO L93 Difference]: Finished difference Result 431 states and 613 transitions. [2025-02-07 21:14:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,665 INFO L225 Difference]: With dead ends: 431 [2025-02-07 21:14:08,665 INFO L226 Difference]: Without dead ends: 242 [2025-02-07 21:14:08,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:08,666 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 501 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 528 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-07 21:14:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2025-02-07 21:14:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 221 states have internal predecessors, (315), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 325 transitions. [2025-02-07 21:14:08,676 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 325 transitions. Word has length 175 [2025-02-07 21:14:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 325 transitions. [2025-02-07 21:14:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 325 transitions. [2025-02-07 21:14:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:08,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 21:14:08,677 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -775776214, now seen corresponding path program 1 times [2025-02-07 21:14:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073952650] [2025-02-07 21:14:08,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:08,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:08,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073952650] [2025-02-07 21:14:08,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073952650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927594265] [2025-02-07 21:14:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:08,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:08,760 INFO L87 Difference]: Start difference. First operand 232 states and 325 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,004 INFO L93 Difference]: Finished difference Result 498 states and 691 transitions. [2025-02-07 21:14:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,006 INFO L225 Difference]: With dead ends: 498 [2025-02-07 21:14:09,006 INFO L226 Difference]: Without dead ends: 310 [2025-02-07 21:14:09,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:09,007 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 534 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1021 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-07 21:14:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 232. [2025-02-07 21:14:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2025-02-07 21:14:09,016 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 175 [2025-02-07 21:14:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,016 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2025-02-07 21:14:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2025-02-07 21:14:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:09,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:09,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 21:14:09,017 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash -631366519, now seen corresponding path program 1 times [2025-02-07 21:14:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235038536] [2025-02-07 21:14:09,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:09,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235038536] [2025-02-07 21:14:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235038536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91921272] [2025-02-07 21:14:09,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:09,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,099 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,328 INFO L93 Difference]: Finished difference Result 496 states and 686 transitions. [2025-02-07 21:14:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,329 INFO L225 Difference]: With dead ends: 496 [2025-02-07 21:14:09,329 INFO L226 Difference]: Without dead ends: 309 [2025-02-07 21:14:09,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:09,330 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 530 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1009 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-07 21:14:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 232. [2025-02-07 21:14:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.416289592760181) internal successors, (313), 221 states have internal predecessors, (313), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2025-02-07 21:14:09,344 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 175 [2025-02-07 21:14:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,344 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2025-02-07 21:14:09,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2025-02-07 21:14:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:09,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:09,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 21:14:09,345 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -903802806, now seen corresponding path program 1 times [2025-02-07 21:14:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360051] [2025-02-07 21:14:09,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:09,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:09,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360051] [2025-02-07 21:14:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099416333] [2025-02-07 21:14:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:09,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,430 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,662 INFO L93 Difference]: Finished difference Result 494 states and 681 transitions. [2025-02-07 21:14:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,664 INFO L225 Difference]: With dead ends: 494 [2025-02-07 21:14:09,664 INFO L226 Difference]: Without dead ends: 308 [2025-02-07 21:14:09,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:09,665 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 526 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 997 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-07 21:14:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 232. [2025-02-07 21:14:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.411764705882353) internal successors, (312), 221 states have internal predecessors, (312), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 322 transitions. [2025-02-07 21:14:09,677 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 322 transitions. Word has length 175 [2025-02-07 21:14:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,677 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 322 transitions. [2025-02-07 21:14:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 322 transitions. [2025-02-07 21:14:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:09,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:09,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 21:14:09,679 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1581260905, now seen corresponding path program 1 times [2025-02-07 21:14:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733467937] [2025-02-07 21:14:09,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:09,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733467937] [2025-02-07 21:14:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733467937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704169543] [2025-02-07 21:14:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:09,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:09,747 INFO L87 Difference]: Start difference. First operand 232 states and 322 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,909 INFO L93 Difference]: Finished difference Result 423 states and 593 transitions. [2025-02-07 21:14:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,910 INFO L225 Difference]: With dead ends: 423 [2025-02-07 21:14:09,910 INFO L226 Difference]: Without dead ends: 238 [2025-02-07 21:14:09,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,911 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 498 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 476 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-07 21:14:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-02-07 21:14:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.407239819004525) internal successors, (311), 221 states have internal predecessors, (311), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2025-02-07 21:14:09,927 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 175 [2025-02-07 21:14:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,927 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2025-02-07 21:14:09,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2025-02-07 21:14:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:09,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 21:14:09,928 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1107234922, now seen corresponding path program 1 times [2025-02-07 21:14:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468198083] [2025-02-07 21:14:09,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:09,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:09,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468198083] [2025-02-07 21:14:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468198083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253050597] [2025-02-07 21:14:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:10,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:10,016 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,195 INFO L93 Difference]: Finished difference Result 421 states and 588 transitions. [2025-02-07 21:14:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,196 INFO L225 Difference]: With dead ends: 421 [2025-02-07 21:14:10,197 INFO L226 Difference]: Without dead ends: 237 [2025-02-07 21:14:10,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:10,197 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 486 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 488 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-07 21:14:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 232. [2025-02-07 21:14:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.4027149321266967) internal successors, (310), 221 states have internal predecessors, (310), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 320 transitions. [2025-02-07 21:14:10,216 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 320 transitions. Word has length 175 [2025-02-07 21:14:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 320 transitions. [2025-02-07 21:14:10,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 320 transitions. [2025-02-07 21:14:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:10,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:10,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 21:14:10,218 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 814849097, now seen corresponding path program 1 times [2025-02-07 21:14:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055832723] [2025-02-07 21:14:10,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:10,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:10,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055832723] [2025-02-07 21:14:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055832723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547922567] [2025-02-07 21:14:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:10,308 INFO L87 Difference]: Start difference. First operand 232 states and 320 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,550 INFO L93 Difference]: Finished difference Result 488 states and 666 transitions. [2025-02-07 21:14:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,552 INFO L225 Difference]: With dead ends: 488 [2025-02-07 21:14:10,552 INFO L226 Difference]: Without dead ends: 305 [2025-02-07 21:14:10,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:10,553 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 514 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 961 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-07 21:14:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 232. [2025-02-07 21:14:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3981900452488687) internal successors, (309), 221 states have internal predecessors, (309), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2025-02-07 21:14:10,565 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 175 [2025-02-07 21:14:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,565 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2025-02-07 21:14:10,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2025-02-07 21:14:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 21:14:10,566 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1549887350, now seen corresponding path program 1 times [2025-02-07 21:14:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042418397] [2025-02-07 21:14:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:10,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:10,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042418397] [2025-02-07 21:14:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042418397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110699776] [2025-02-07 21:14:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:10,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:10,660 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,895 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2025-02-07 21:14:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,896 INFO L225 Difference]: With dead ends: 486 [2025-02-07 21:14:10,896 INFO L226 Difference]: Without dead ends: 304 [2025-02-07 21:14:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:10,897 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 510 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 949 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-07 21:14:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 232. [2025-02-07 21:14:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3936651583710407) internal successors, (308), 221 states have internal predecessors, (308), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2025-02-07 21:14:10,910 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 175 [2025-02-07 21:14:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2025-02-07 21:14:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2025-02-07 21:14:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:10,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:10,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 21:14:10,911 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1764716503, now seen corresponding path program 1 times [2025-02-07 21:14:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747988674] [2025-02-07 21:14:10,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:10,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:10,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747988674] [2025-02-07 21:14:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747988674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622790007] [2025-02-07 21:14:10,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:10,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:10,990 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,228 INFO L93 Difference]: Finished difference Result 484 states and 656 transitions. [2025-02-07 21:14:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,230 INFO L225 Difference]: With dead ends: 484 [2025-02-07 21:14:11,230 INFO L226 Difference]: Without dead ends: 303 [2025-02-07 21:14:11,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:11,231 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 506 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 937 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-07 21:14:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 232. [2025-02-07 21:14:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3891402714932126) internal successors, (307), 221 states have internal predecessors, (307), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2025-02-07 21:14:11,243 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 175 [2025-02-07 21:14:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,244 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2025-02-07 21:14:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2025-02-07 21:14:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 21:14:11,245 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 29468842, now seen corresponding path program 1 times [2025-02-07 21:14:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976303285] [2025-02-07 21:14:11,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976303285] [2025-02-07 21:14:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976303285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877877035] [2025-02-07 21:14:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,297 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,311 INFO L93 Difference]: Finished difference Result 405 states and 560 transitions. [2025-02-07 21:14:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,313 INFO L225 Difference]: With dead ends: 405 [2025-02-07 21:14:11,313 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,315 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 221 states have internal predecessors, (306), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-02-07 21:14:11,329 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 175 [2025-02-07 21:14:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,330 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-02-07 21:14:11,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-02-07 21:14:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 21:14:11,331 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1255714633, now seen corresponding path program 1 times [2025-02-07 21:14:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431249045] [2025-02-07 21:14:11,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431249045] [2025-02-07 21:14:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431249045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515476714] [2025-02-07 21:14:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,372 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,385 INFO L93 Difference]: Finished difference Result 395 states and 545 transitions. [2025-02-07 21:14:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,387 INFO L225 Difference]: With dead ends: 395 [2025-02-07 21:14:11,387 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,388 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3800904977375565) internal successors, (305), 221 states have internal predecessors, (305), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 315 transitions. [2025-02-07 21:14:11,402 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 315 transitions. Word has length 175 [2025-02-07 21:14:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,402 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 315 transitions. [2025-02-07 21:14:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 315 transitions. [2025-02-07 21:14:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 21:14:11,404 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1957444376, now seen corresponding path program 1 times [2025-02-07 21:14:11,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993201074] [2025-02-07 21:14:11,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993201074] [2025-02-07 21:14:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993201074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186050900] [2025-02-07 21:14:11,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,446 INFO L87 Difference]: Start difference. First operand 232 states and 315 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,460 INFO L93 Difference]: Finished difference Result 400 states and 550 transitions. [2025-02-07 21:14:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,462 INFO L225 Difference]: With dead ends: 400 [2025-02-07 21:14:11,462 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,463 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 0 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3755656108597285) internal successors, (304), 221 states have internal predecessors, (304), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 314 transitions. [2025-02-07 21:14:11,475 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 314 transitions. Word has length 175 [2025-02-07 21:14:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,476 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 314 transitions. [2025-02-07 21:14:11,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 314 transitions. [2025-02-07 21:14:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 21:14:11,477 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1190982407, now seen corresponding path program 1 times [2025-02-07 21:14:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012706768] [2025-02-07 21:14:11,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012706768] [2025-02-07 21:14:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012706768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39767600] [2025-02-07 21:14:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,517 INFO L87 Difference]: Start difference. First operand 232 states and 314 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,529 INFO L93 Difference]: Finished difference Result 390 states and 536 transitions. [2025-02-07 21:14:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,530 INFO L225 Difference]: With dead ends: 390 [2025-02-07 21:14:11,530 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,531 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 622 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 313 transitions. [2025-02-07 21:14:11,543 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 313 transitions. Word has length 175 [2025-02-07 21:14:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,543 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 313 transitions. [2025-02-07 21:14:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 313 transitions. [2025-02-07 21:14:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 21:14:11,544 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1268142042, now seen corresponding path program 1 times [2025-02-07 21:14:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281678580] [2025-02-07 21:14:11,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281678580] [2025-02-07 21:14:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281678580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358236673] [2025-02-07 21:14:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,600 INFO L87 Difference]: Start difference. First operand 232 states and 313 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,612 INFO L93 Difference]: Finished difference Result 385 states and 528 transitions. [2025-02-07 21:14:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,614 INFO L225 Difference]: With dead ends: 385 [2025-02-07 21:14:11,615 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,615 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3665158371040724) internal successors, (302), 221 states have internal predecessors, (302), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 312 transitions. [2025-02-07 21:14:11,627 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 312 transitions. Word has length 175 [2025-02-07 21:14:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,627 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 312 transitions. [2025-02-07 21:14:11,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 312 transitions. [2025-02-07 21:14:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 21:14:11,628 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2093470917, now seen corresponding path program 1 times [2025-02-07 21:14:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871682110] [2025-02-07 21:14:11,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871682110] [2025-02-07 21:14:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871682110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964427965] [2025-02-07 21:14:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,675 INFO L87 Difference]: Start difference. First operand 232 states and 312 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,688 INFO L93 Difference]: Finished difference Result 375 states and 513 transitions. [2025-02-07 21:14:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,690 INFO L225 Difference]: With dead ends: 375 [2025-02-07 21:14:11,690 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,691 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3619909502262444) internal successors, (301), 221 states have internal predecessors, (301), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 311 transitions. [2025-02-07 21:14:11,703 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 311 transitions. Word has length 175 [2025-02-07 21:14:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,703 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 311 transitions. [2025-02-07 21:14:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 311 transitions. [2025-02-07 21:14:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 21:14:11,704 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1283983460, now seen corresponding path program 1 times [2025-02-07 21:14:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801568749] [2025-02-07 21:14:11,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801568749] [2025-02-07 21:14:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801568749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336176604] [2025-02-07 21:14:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,757 INFO L87 Difference]: Start difference. First operand 232 states and 311 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,770 INFO L93 Difference]: Finished difference Result 365 states and 498 transitions. [2025-02-07 21:14:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,771 INFO L225 Difference]: With dead ends: 365 [2025-02-07 21:14:11,771 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,772 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 616 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3574660633484164) internal successors, (300), 221 states have internal predecessors, (300), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 310 transitions. [2025-02-07 21:14:11,788 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 310 transitions. Word has length 175 [2025-02-07 21:14:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,788 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 310 transitions. [2025-02-07 21:14:11,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2025-02-07 21:14:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 21:14:11,789 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1842787581, now seen corresponding path program 1 times [2025-02-07 21:14:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353319103] [2025-02-07 21:14:11,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353319103] [2025-02-07 21:14:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353319103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388773605] [2025-02-07 21:14:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,843 INFO L87 Difference]: Start difference. First operand 232 states and 310 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,858 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2025-02-07 21:14:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,860 INFO L225 Difference]: With dead ends: 380 [2025-02-07 21:14:11,860 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,861 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 614 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 221 states have internal predecessors, (299), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2025-02-07 21:14:11,881 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 175 [2025-02-07 21:14:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,881 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2025-02-07 21:14:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2025-02-07 21:14:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 21:14:11,882 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1498978082, now seen corresponding path program 1 times [2025-02-07 21:14:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905753051] [2025-02-07 21:14:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:11,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:11,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905753051] [2025-02-07 21:14:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905753051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302742152] [2025-02-07 21:14:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:11,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,949 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,969 INFO L93 Difference]: Finished difference Result 350 states and 475 transitions. [2025-02-07 21:14:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:11,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,971 INFO L225 Difference]: With dead ends: 350 [2025-02-07 21:14:11,971 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:11,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:11,972 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 221 states have internal predecessors, (298), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 308 transitions. [2025-02-07 21:14:11,989 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 308 transitions. Word has length 175 [2025-02-07 21:14:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,989 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 308 transitions. [2025-02-07 21:14:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 308 transitions. [2025-02-07 21:14:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:11,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:11,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 21:14:11,990 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1942589505, now seen corresponding path program 1 times [2025-02-07 21:14:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575004055] [2025-02-07 21:14:11,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575004055] [2025-02-07 21:14:12,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575004055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94802230] [2025-02-07 21:14:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,035 INFO L87 Difference]: Start difference. First operand 232 states and 308 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,049 INFO L93 Difference]: Finished difference Result 360 states and 487 transitions. [2025-02-07 21:14:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,051 INFO L225 Difference]: With dead ends: 360 [2025-02-07 21:14:12,051 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,051 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3438914027149322) internal successors, (297), 221 states have internal predecessors, (297), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 307 transitions. [2025-02-07 21:14:12,065 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 307 transitions. Word has length 175 [2025-02-07 21:14:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,065 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 307 transitions. [2025-02-07 21:14:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 307 transitions. [2025-02-07 21:14:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 21:14:12,066 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1568998816, now seen corresponding path program 1 times [2025-02-07 21:14:12,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406516137] [2025-02-07 21:14:12,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406516137] [2025-02-07 21:14:12,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406516137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314731645] [2025-02-07 21:14:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,108 INFO L87 Difference]: Start difference. First operand 232 states and 307 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,120 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2025-02-07 21:14:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,122 INFO L225 Difference]: With dead ends: 355 [2025-02-07 21:14:12,122 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,124 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.339366515837104) internal successors, (296), 221 states have internal predecessors, (296), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 306 transitions. [2025-02-07 21:14:12,136 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 306 transitions. Word has length 175 [2025-02-07 21:14:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,137 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 306 transitions. [2025-02-07 21:14:12,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 306 transitions. [2025-02-07 21:14:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 21:14:12,138 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1149481985, now seen corresponding path program 1 times [2025-02-07 21:14:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766358712] [2025-02-07 21:14:12,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766358712] [2025-02-07 21:14:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766358712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743076115] [2025-02-07 21:14:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,183 INFO L87 Difference]: Start difference. First operand 232 states and 306 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,206 INFO L93 Difference]: Finished difference Result 340 states and 458 transitions. [2025-02-07 21:14:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,208 INFO L225 Difference]: With dead ends: 340 [2025-02-07 21:14:12,209 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,210 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.334841628959276) internal successors, (295), 221 states have internal predecessors, (295), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 305 transitions. [2025-02-07 21:14:12,223 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 305 transitions. Word has length 175 [2025-02-07 21:14:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 305 transitions. [2025-02-07 21:14:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 305 transitions. [2025-02-07 21:14:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 21:14:12,226 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 632017950, now seen corresponding path program 1 times [2025-02-07 21:14:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877315476] [2025-02-07 21:14:12,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877315476] [2025-02-07 21:14:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877315476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008612393] [2025-02-07 21:14:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,309 INFO L87 Difference]: Start difference. First operand 232 states and 305 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,459 INFO L93 Difference]: Finished difference Result 330 states and 444 transitions. [2025-02-07 21:14:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,461 INFO L225 Difference]: With dead ends: 330 [2025-02-07 21:14:12,461 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:12,462 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 449 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 459 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.330316742081448) internal successors, (294), 221 states have internal predecessors, (294), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 304 transitions. [2025-02-07 21:14:12,475 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 304 transitions. Word has length 175 [2025-02-07 21:14:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 304 transitions. [2025-02-07 21:14:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 304 transitions. [2025-02-07 21:14:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 21:14:12,477 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1262476575, now seen corresponding path program 1 times [2025-02-07 21:14:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054071862] [2025-02-07 21:14:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054071862] [2025-02-07 21:14:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054071862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798291398] [2025-02-07 21:14:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,515 INFO L87 Difference]: Start difference. First operand 232 states and 304 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,527 INFO L93 Difference]: Finished difference Result 345 states and 461 transitions. [2025-02-07 21:14:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,528 INFO L225 Difference]: With dead ends: 345 [2025-02-07 21:14:12,528 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,529 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 221 states have internal predecessors, (293), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 303 transitions. [2025-02-07 21:14:12,543 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 303 transitions. Word has length 175 [2025-02-07 21:14:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,543 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 303 transitions. [2025-02-07 21:14:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 303 transitions. [2025-02-07 21:14:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 21:14:12,545 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2078261826, now seen corresponding path program 1 times [2025-02-07 21:14:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851404807] [2025-02-07 21:14:12,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851404807] [2025-02-07 21:14:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851404807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929439427] [2025-02-07 21:14:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:12,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:12,654 INFO L87 Difference]: Start difference. First operand 232 states and 303 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,923 INFO L93 Difference]: Finished difference Result 403 states and 530 transitions. [2025-02-07 21:14:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,925 INFO L225 Difference]: With dead ends: 403 [2025-02-07 21:14:12,925 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:12,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:12,925 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 589 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 575 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3212669683257918) internal successors, (292), 221 states have internal predecessors, (292), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 302 transitions. [2025-02-07 21:14:12,937 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 302 transitions. Word has length 175 [2025-02-07 21:14:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,937 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 302 transitions. [2025-02-07 21:14:12,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 302 transitions. [2025-02-07 21:14:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 21:14:12,938 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2057924451, now seen corresponding path program 1 times [2025-02-07 21:14:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718436962] [2025-02-07 21:14:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:12,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718436962] [2025-02-07 21:14:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718436962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138386539] [2025-02-07 21:14:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:12,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,976 INFO L87 Difference]: Start difference. First operand 232 states and 302 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,986 INFO L93 Difference]: Finished difference Result 335 states and 445 transitions. [2025-02-07 21:14:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:12,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,988 INFO L225 Difference]: With dead ends: 335 [2025-02-07 21:14:12,988 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:12,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:12,988 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 221 states have internal predecessors, (291), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 301 transitions. [2025-02-07 21:14:12,998 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 301 transitions. Word has length 175 [2025-02-07 21:14:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 301 transitions. [2025-02-07 21:14:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 301 transitions. [2025-02-07 21:14:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:12,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 21:14:12,999 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 429195324, now seen corresponding path program 1 times [2025-02-07 21:14:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547642510] [2025-02-07 21:14:12,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:13,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:13,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547642510] [2025-02-07 21:14:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547642510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389791038] [2025-02-07 21:14:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,091 INFO L87 Difference]: Start difference. First operand 232 states and 301 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,348 INFO L93 Difference]: Finished difference Result 402 states and 525 transitions. [2025-02-07 21:14:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,349 INFO L225 Difference]: With dead ends: 402 [2025-02-07 21:14:13,349 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:13,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:13,350 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 582 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 573 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3122171945701357) internal successors, (290), 221 states have internal predecessors, (290), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 300 transitions. [2025-02-07 21:14:13,361 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 300 transitions. Word has length 175 [2025-02-07 21:14:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,361 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 300 transitions. [2025-02-07 21:14:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 300 transitions. [2025-02-07 21:14:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:13,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 21:14:13,363 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1122588029, now seen corresponding path program 1 times [2025-02-07 21:14:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042084918] [2025-02-07 21:14:13,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042084918] [2025-02-07 21:14:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042084918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254587850] [2025-02-07 21:14:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,467 INFO L87 Difference]: Start difference. First operand 232 states and 300 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,730 INFO L93 Difference]: Finished difference Result 401 states and 522 transitions. [2025-02-07 21:14:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,732 INFO L225 Difference]: With dead ends: 401 [2025-02-07 21:14:13,732 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:13,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:13,733 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 578 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 571 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3076923076923077) internal successors, (289), 221 states have internal predecessors, (289), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 299 transitions. [2025-02-07 21:14:13,744 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 299 transitions. Word has length 175 [2025-02-07 21:14:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,744 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 299 transitions. [2025-02-07 21:14:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 299 transitions. [2025-02-07 21:14:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:13,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 21:14:13,745 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1560597532, now seen corresponding path program 1 times [2025-02-07 21:14:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163901988] [2025-02-07 21:14:13,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:13,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:13,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163901988] [2025-02-07 21:14:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163901988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866295724] [2025-02-07 21:14:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,840 INFO L87 Difference]: Start difference. First operand 232 states and 299 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,105 INFO L93 Difference]: Finished difference Result 400 states and 519 transitions. [2025-02-07 21:14:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,107 INFO L225 Difference]: With dead ends: 400 [2025-02-07 21:14:14,108 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:14,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:14,108 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 574 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 569 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.3031674208144797) internal successors, (288), 221 states have internal predecessors, (288), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 298 transitions. [2025-02-07 21:14:14,122 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 298 transitions. Word has length 175 [2025-02-07 21:14:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,122 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 298 transitions. [2025-02-07 21:14:14,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 298 transitions. [2025-02-07 21:14:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:14,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 21:14:14,123 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -364935779, now seen corresponding path program 1 times [2025-02-07 21:14:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138488686] [2025-02-07 21:14:14,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:14,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138488686] [2025-02-07 21:14:14,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138488686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608997567] [2025-02-07 21:14:14,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:14,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:14,271 INFO L87 Difference]: Start difference. First operand 232 states and 298 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,573 INFO L93 Difference]: Finished difference Result 399 states and 516 transitions. [2025-02-07 21:14:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,576 INFO L225 Difference]: With dead ends: 399 [2025-02-07 21:14:14,576 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:14,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:14,576 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 570 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 567 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:14:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2986425339366516) internal successors, (287), 221 states have internal predecessors, (287), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2025-02-07 21:14:14,589 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 175 [2025-02-07 21:14:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,590 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2025-02-07 21:14:14,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2025-02-07 21:14:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:14,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 21:14:14,591 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash 404234236, now seen corresponding path program 1 times [2025-02-07 21:14:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186040704] [2025-02-07 21:14:14,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:14,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:14,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186040704] [2025-02-07 21:14:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186040704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022173722] [2025-02-07 21:14:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:14,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,667 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,804 INFO L93 Difference]: Finished difference Result 324 states and 424 transitions. [2025-02-07 21:14:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,805 INFO L225 Difference]: With dead ends: 324 [2025-02-07 21:14:14,805 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:14,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:14,807 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 427 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 447 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 221 states have internal predecessors, (286), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 296 transitions. [2025-02-07 21:14:14,819 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 296 transitions. Word has length 175 [2025-02-07 21:14:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,820 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 296 transitions. [2025-02-07 21:14:14,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 296 transitions. [2025-02-07 21:14:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:14,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:14,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 21:14:14,822 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1537424829, now seen corresponding path program 1 times [2025-02-07 21:14:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797365436] [2025-02-07 21:14:14,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797365436] [2025-02-07 21:14:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797365436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132435469] [2025-02-07 21:14:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:14,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:14,916 INFO L87 Difference]: Start difference. First operand 232 states and 296 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,194 INFO L93 Difference]: Finished difference Result 396 states and 508 transitions. [2025-02-07 21:14:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,196 INFO L225 Difference]: With dead ends: 396 [2025-02-07 21:14:15,196 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:15,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:15,196 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 561 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 563 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2895927601809956) internal successors, (285), 221 states have internal predecessors, (285), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 295 transitions. [2025-02-07 21:14:15,207 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 295 transitions. Word has length 175 [2025-02-07 21:14:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,208 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 295 transitions. [2025-02-07 21:14:15,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 295 transitions. [2025-02-07 21:14:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:15,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 21:14:15,209 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1529665470, now seen corresponding path program 1 times [2025-02-07 21:14:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594824565] [2025-02-07 21:14:15,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:15,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:15,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594824565] [2025-02-07 21:14:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594824565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460981596] [2025-02-07 21:14:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:15,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,278 INFO L87 Difference]: Start difference. First operand 232 states and 295 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,415 INFO L93 Difference]: Finished difference Result 321 states and 416 transitions. [2025-02-07 21:14:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,416 INFO L225 Difference]: With dead ends: 321 [2025-02-07 21:14:15,416 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:15,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:15,417 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 420 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 443 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 221 states have internal predecessors, (284), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 294 transitions. [2025-02-07 21:14:15,427 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 294 transitions. Word has length 175 [2025-02-07 21:14:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,428 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 294 transitions. [2025-02-07 21:14:15,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 294 transitions. [2025-02-07 21:14:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:15,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 21:14:15,429 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1795720803, now seen corresponding path program 1 times [2025-02-07 21:14:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94237749] [2025-02-07 21:14:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:15,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:15,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94237749] [2025-02-07 21:14:15,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94237749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:15,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450659978] [2025-02-07 21:14:15,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:15,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,498 INFO L87 Difference]: Start difference. First operand 232 states and 294 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,632 INFO L93 Difference]: Finished difference Result 320 states and 413 transitions. [2025-02-07 21:14:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,633 INFO L225 Difference]: With dead ends: 320 [2025-02-07 21:14:15,633 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:15,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:15,634 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 417 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 441 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2805429864253393) internal successors, (283), 221 states have internal predecessors, (283), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 293 transitions. [2025-02-07 21:14:15,644 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 293 transitions. Word has length 175 [2025-02-07 21:14:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 293 transitions. [2025-02-07 21:14:15,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 293 transitions. [2025-02-07 21:14:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 21:14:15,647 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash 175218654, now seen corresponding path program 1 times [2025-02-07 21:14:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772839604] [2025-02-07 21:14:15,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:15,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:15,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772839604] [2025-02-07 21:14:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772839604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410572321] [2025-02-07 21:14:15,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:15,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,714 INFO L87 Difference]: Start difference. First operand 232 states and 293 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,857 INFO L93 Difference]: Finished difference Result 319 states and 410 transitions. [2025-02-07 21:14:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:15,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,858 INFO L225 Difference]: With dead ends: 319 [2025-02-07 21:14:15,858 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:15,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:15,859 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 414 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 439 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2760180995475112) internal successors, (282), 221 states have internal predecessors, (282), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 292 transitions. [2025-02-07 21:14:15,869 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 292 transitions. Word has length 175 [2025-02-07 21:14:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,870 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 292 transitions. [2025-02-07 21:14:15,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 292 transitions. [2025-02-07 21:14:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:15,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:15,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 21:14:15,871 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1008128643, now seen corresponding path program 1 times [2025-02-07 21:14:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859669346] [2025-02-07 21:14:15,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:15,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:15,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859669346] [2025-02-07 21:14:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859669346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622803637] [2025-02-07 21:14:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:15,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:15,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:15,956 INFO L87 Difference]: Start difference. First operand 232 states and 292 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:16,214 INFO L93 Difference]: Finished difference Result 392 states and 496 transitions. [2025-02-07 21:14:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:16,216 INFO L225 Difference]: With dead ends: 392 [2025-02-07 21:14:16,216 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:16,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:16,216 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 545 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:16,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 555 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2714932126696832) internal successors, (281), 221 states have internal predecessors, (281), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 291 transitions. [2025-02-07 21:14:16,227 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 291 transitions. Word has length 175 [2025-02-07 21:14:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:16,228 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 291 transitions. [2025-02-07 21:14:16,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2025-02-07 21:14:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:16,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:16,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:16,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 21:14:16,229 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:16,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1586098174, now seen corresponding path program 1 times [2025-02-07 21:14:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771185061] [2025-02-07 21:14:16,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:16,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:16,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771185061] [2025-02-07 21:14:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771185061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206492120] [2025-02-07 21:14:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:16,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:16,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:16,319 INFO L87 Difference]: Start difference. First operand 232 states and 291 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:16,575 INFO L93 Difference]: Finished difference Result 391 states and 493 transitions. [2025-02-07 21:14:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:16,576 INFO L225 Difference]: With dead ends: 391 [2025-02-07 21:14:16,577 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:16,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:16,577 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 541 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:16,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 553 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 221 states have internal predecessors, (280), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 290 transitions. [2025-02-07 21:14:16,591 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 290 transitions. Word has length 175 [2025-02-07 21:14:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:16,591 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 290 transitions. [2025-02-07 21:14:16,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 290 transitions. [2025-02-07 21:14:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:16,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:16,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 21:14:16,593 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 561404253, now seen corresponding path program 1 times [2025-02-07 21:14:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340363545] [2025-02-07 21:14:16,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:16,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340363545] [2025-02-07 21:14:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340363545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:16,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66307703] [2025-02-07 21:14:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:16,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:16,671 INFO L87 Difference]: Start difference. First operand 232 states and 290 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:16,807 INFO L93 Difference]: Finished difference Result 316 states and 401 transitions. [2025-02-07 21:14:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:16,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:16,808 INFO L225 Difference]: With dead ends: 316 [2025-02-07 21:14:16,808 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:16,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:16,809 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 405 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 433 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.262443438914027) internal successors, (279), 221 states have internal predecessors, (279), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 289 transitions. [2025-02-07 21:14:16,820 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 289 transitions. Word has length 175 [2025-02-07 21:14:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:16,820 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 289 transitions. [2025-02-07 21:14:16,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 289 transitions. [2025-02-07 21:14:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:16,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:16,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:16,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 21:14:16,821 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 112707614, now seen corresponding path program 1 times [2025-02-07 21:14:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327039751] [2025-02-07 21:14:16,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:16,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:16,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:16,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327039751] [2025-02-07 21:14:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327039751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:16,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677541621] [2025-02-07 21:14:16,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:16,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:16,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:16,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:16,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:16,886 INFO L87 Difference]: Start difference. First operand 232 states and 289 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:17,019 INFO L93 Difference]: Finished difference Result 314 states and 396 transitions. [2025-02-07 21:14:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:17,020 INFO L225 Difference]: With dead ends: 314 [2025-02-07 21:14:17,020 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:17,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:17,021 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 401 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:17,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 431 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.257918552036199) internal successors, (278), 221 states have internal predecessors, (278), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2025-02-07 21:14:17,031 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 175 [2025-02-07 21:14:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:17,032 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2025-02-07 21:14:17,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2025-02-07 21:14:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:17,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:17,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:17,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 21:14:17,032 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:17,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1822952673, now seen corresponding path program 1 times [2025-02-07 21:14:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543057349] [2025-02-07 21:14:17,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:17,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:17,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:17,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543057349] [2025-02-07 21:14:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543057349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142050547] [2025-02-07 21:14:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:17,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:17,094 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:17,226 INFO L93 Difference]: Finished difference Result 313 states and 393 transitions. [2025-02-07 21:14:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:17,227 INFO L225 Difference]: With dead ends: 313 [2025-02-07 21:14:17,227 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:17,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:17,228 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 398 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:17,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 429 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.253393665158371) internal successors, (277), 221 states have internal predecessors, (277), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 287 transitions. [2025-02-07 21:14:17,238 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 287 transitions. Word has length 175 [2025-02-07 21:14:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:17,238 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 287 transitions. [2025-02-07 21:14:17,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 287 transitions. [2025-02-07 21:14:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:17,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:17,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:17,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 21:14:17,240 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:17,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -361372674, now seen corresponding path program 1 times [2025-02-07 21:14:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853453048] [2025-02-07 21:14:17,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:17,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853453048] [2025-02-07 21:14:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853453048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:17,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234570141] [2025-02-07 21:14:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:17,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:17,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:17,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:17,338 INFO L87 Difference]: Start difference. First operand 232 states and 287 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:17,594 INFO L93 Difference]: Finished difference Result 386 states and 479 transitions. [2025-02-07 21:14:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:17,596 INFO L225 Difference]: With dead ends: 386 [2025-02-07 21:14:17,596 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:17,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:17,596 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 523 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:17,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 545 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.248868778280543) internal successors, (276), 221 states have internal predecessors, (276), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2025-02-07 21:14:17,608 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 175 [2025-02-07 21:14:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:17,608 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2025-02-07 21:14:17,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2025-02-07 21:14:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:17,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:17,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-07 21:14:17,610 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:17,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1284056257, now seen corresponding path program 1 times [2025-02-07 21:14:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222442903] [2025-02-07 21:14:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:17,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:17,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:17,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:17,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:17,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222442903] [2025-02-07 21:14:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222442903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:17,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:17,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658956509] [2025-02-07 21:14:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:17,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:17,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:17,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:17,686 INFO L87 Difference]: Start difference. First operand 232 states and 286 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:17,823 INFO L93 Difference]: Finished difference Result 311 states and 387 transitions. [2025-02-07 21:14:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:17,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:17,824 INFO L225 Difference]: With dead ends: 311 [2025-02-07 21:14:17,824 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:17,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:17,824 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 392 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:17,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 425 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.244343891402715) internal successors, (275), 221 states have internal predecessors, (275), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 285 transitions. [2025-02-07 21:14:17,836 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 285 transitions. Word has length 175 [2025-02-07 21:14:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:17,836 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 285 transitions. [2025-02-07 21:14:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 285 transitions. [2025-02-07 21:14:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:17,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:17,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-07 21:14:17,837 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:17,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 348747742, now seen corresponding path program 1 times [2025-02-07 21:14:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499783539] [2025-02-07 21:14:17,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499783539] [2025-02-07 21:14:17,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499783539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:17,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:17,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:17,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265767611] [2025-02-07 21:14:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:17,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:17,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:17,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:17,935 INFO L87 Difference]: Start difference. First operand 232 states and 285 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:18,192 INFO L93 Difference]: Finished difference Result 384 states and 473 transitions. [2025-02-07 21:14:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:18,193 INFO L225 Difference]: With dead ends: 384 [2025-02-07 21:14:18,193 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:18,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:18,194 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 515 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:18,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 541 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.239819004524887) internal successors, (274), 221 states have internal predecessors, (274), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-02-07 21:14:18,218 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 175 [2025-02-07 21:14:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:18,218 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-02-07 21:14:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-02-07 21:14:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:18,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:18,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-07 21:14:18,219 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash 678513503, now seen corresponding path program 1 times [2025-02-07 21:14:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078810666] [2025-02-07 21:14:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:18,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:18,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:18,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:18,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078810666] [2025-02-07 21:14:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078810666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:18,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309992497] [2025-02-07 21:14:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:18,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:18,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:18,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:18,311 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:18,570 INFO L93 Difference]: Finished difference Result 383 states and 470 transitions. [2025-02-07 21:14:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:18,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:18,571 INFO L225 Difference]: With dead ends: 383 [2025-02-07 21:14:18,571 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:18,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:18,572 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 511 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:18,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 539 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2352941176470589) internal successors, (273), 221 states have internal predecessors, (273), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 283 transitions. [2025-02-07 21:14:18,583 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 283 transitions. Word has length 175 [2025-02-07 21:14:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:18,583 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 283 transitions. [2025-02-07 21:14:18,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 283 transitions. [2025-02-07 21:14:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:18,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:18,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:18,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-07 21:14:18,584 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1666153538, now seen corresponding path program 1 times [2025-02-07 21:14:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394397211] [2025-02-07 21:14:18,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:18,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:18,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:18,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:18,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394397211] [2025-02-07 21:14:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394397211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:18,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91780919] [2025-02-07 21:14:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:18,673 INFO L87 Difference]: Start difference. First operand 232 states and 283 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:18,927 INFO L93 Difference]: Finished difference Result 382 states and 467 transitions. [2025-02-07 21:14:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:18,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:18,928 INFO L225 Difference]: With dead ends: 382 [2025-02-07 21:14:18,928 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:18,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:18,929 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 507 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:18,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 537 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2307692307692308) internal successors, (272), 221 states have internal predecessors, (272), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 282 transitions. [2025-02-07 21:14:18,940 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 282 transitions. Word has length 175 [2025-02-07 21:14:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:18,940 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 282 transitions. [2025-02-07 21:14:18,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 282 transitions. [2025-02-07 21:14:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:18,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:18,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:18,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-07 21:14:18,941 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:18,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash 59327359, now seen corresponding path program 1 times [2025-02-07 21:14:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:18,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828458099] [2025-02-07 21:14:18,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:18,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:18,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:18,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:18,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828458099] [2025-02-07 21:14:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828458099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906862955] [2025-02-07 21:14:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:19,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:19,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:19,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:19,014 INFO L87 Difference]: Start difference. First operand 232 states and 282 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:19,153 INFO L93 Difference]: Finished difference Result 306 states and 373 transitions. [2025-02-07 21:14:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:19,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:19,154 INFO L225 Difference]: With dead ends: 306 [2025-02-07 21:14:19,155 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:19,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:19,155 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 379 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:19,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 417 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-07 21:14:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2262443438914028) internal successors, (271), 221 states have internal predecessors, (271), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2025-02-07 21:14:19,166 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 175 [2025-02-07 21:14:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:19,166 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2025-02-07 21:14:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2025-02-07 21:14:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:19,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:19,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:19,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-07 21:14:19,167 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2124349568, now seen corresponding path program 1 times [2025-02-07 21:14:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307508138] [2025-02-07 21:14:19,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:19,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:19,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:19,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:19,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307508138] [2025-02-07 21:14:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307508138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251050875] [2025-02-07 21:14:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:19,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:19,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:19,250 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:19,502 INFO L93 Difference]: Finished difference Result 379 states and 459 transitions. [2025-02-07 21:14:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:19,503 INFO L225 Difference]: With dead ends: 379 [2025-02-07 21:14:19,503 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:19,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:19,504 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 498 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:19,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 533 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2217194570135748) internal successors, (270), 221 states have internal predecessors, (270), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 280 transitions. [2025-02-07 21:14:19,515 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 280 transitions. Word has length 175 [2025-02-07 21:14:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:19,515 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 280 transitions. [2025-02-07 21:14:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 280 transitions. [2025-02-07 21:14:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:19,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:19,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:19,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-02-07 21:14:19,516 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:19,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash 160513887, now seen corresponding path program 1 times [2025-02-07 21:14:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071474173] [2025-02-07 21:14:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:19,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:19,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:19,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:19,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:19,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071474173] [2025-02-07 21:14:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071474173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:19,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613620129] [2025-02-07 21:14:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:19,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:19,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:19,597 INFO L87 Difference]: Start difference. First operand 232 states and 280 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:19,853 INFO L93 Difference]: Finished difference Result 378 states and 456 transitions. [2025-02-07 21:14:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:19,854 INFO L225 Difference]: With dead ends: 378 [2025-02-07 21:14:19,854 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:19,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:19,855 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 494 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:19,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 531 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2171945701357465) internal successors, (269), 221 states have internal predecessors, (269), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2025-02-07 21:14:19,866 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 175 [2025-02-07 21:14:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:19,867 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2025-02-07 21:14:19,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2025-02-07 21:14:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:19,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:19,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-02-07 21:14:19,868 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 511313824, now seen corresponding path program 1 times [2025-02-07 21:14:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636162197] [2025-02-07 21:14:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636162197] [2025-02-07 21:14:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636162197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248501008] [2025-02-07 21:14:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:19,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:19,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:19,955 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:20,209 INFO L93 Difference]: Finished difference Result 377 states and 453 transitions. [2025-02-07 21:14:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:20,210 INFO L225 Difference]: With dead ends: 377 [2025-02-07 21:14:20,210 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:20,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:20,211 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 490 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:20,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 529 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2025-02-07 21:14:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 221 states have internal predecessors, (268), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 278 transitions. [2025-02-07 21:14:20,222 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 278 transitions. Word has length 175 [2025-02-07 21:14:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:20,222 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 278 transitions. [2025-02-07 21:14:20,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 278 transitions. [2025-02-07 21:14:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 21:14:20,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:20,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:20,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-02-07 21:14:20,223 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:20,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash 522629951, now seen corresponding path program 1 times [2025-02-07 21:14:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:20,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517837376] [2025-02-07 21:14:20,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:20,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 21:14:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 21:14:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517837376] [2025-02-07 21:14:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517837376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577412003] [2025-02-07 21:14:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:20,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:20,268 INFO L87 Difference]: Start difference. First operand 232 states and 278 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:20,355 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2025-02-07 21:14:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2025-02-07 21:14:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:20,356 INFO L225 Difference]: With dead ends: 236 [2025-02-07 21:14:20,356 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:14:20,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:20,356 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 272 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:20,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 284 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:14:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:14:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-07 21:14:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:14:20,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2025-02-07 21:14:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:20,356 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:14:20,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:14:20,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:14:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:14:20,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-02-07 21:14:20,361 INFO L422 BasicCegarLoop]: Path program 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, 1] [2025-02-07 21:14:20,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:15:09,525 WARN L286 SmtUtils]: Spent 49.16s on a formula simplification. DAG size of input: 139 DAG size of output: 107 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)