./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:50:03,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:50:03,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:50:03,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:50:03,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:50:03,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:50:03,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:50:03,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:50:03,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:50:03,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:50:03,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:50:03,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:50:03,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:50:03,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:50:03,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:50:03,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:50:03,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:50:03,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:50:03,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:50:03,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:50:03,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:50:03,089 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 [2025-03-08 06:50:03,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:50:03,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:50:03,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:50:03,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:50:03,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:50:03,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2025-03-08 06:50:04,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e4ca641/d9aa20800fc44ac0b6c72d5ef28d9d6a/FLAG03d6875ee [2025-03-08 06:50:05,103 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:50:05,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2025-03-08 06:50:05,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e4ca641/d9aa20800fc44ac0b6c72d5ef28d9d6a/FLAG03d6875ee [2025-03-08 06:50:05,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e4ca641/d9aa20800fc44ac0b6c72d5ef28d9d6a [2025-03-08 06:50:05,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:50:05,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:50:05,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:50:05,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:50:05,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:50:05,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:05" (1/1) ... [2025-03-08 06:50:05,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe56402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:05, skipping insertion in model container [2025-03-08 06:50:05,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:05" (1/1) ... [2025-03-08 06:50:05,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:50:06,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[378560,378573] [2025-03-08 06:50:06,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[383339,383352] [2025-03-08 06:50:06,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:50:06,678 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:50:07,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[378560,378573] [2025-03-08 06:50:07,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[383339,383352] [2025-03-08 06:50:07,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:50:07,219 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:50:07,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07 WrapperNode [2025-03-08 06:50:07,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:50:07,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:50:07,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:50:07,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:50:07,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,600 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13134 [2025-03-08 06:50:07,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:50:07,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:50:07,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:50:07,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:50:07,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,766 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-03-08 06:50:07,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:07,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:08,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:08,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:50:08,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:50:08,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:50:08,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:50:08,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (1/1) ... [2025-03-08 06:50:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:50:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:08,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:50:08,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:50:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:50:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:50:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:50:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:50:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:50:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:50:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:50:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:50:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:50:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:50:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:50:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:50:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:50:08,259 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:50:08,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:50:14,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:50:14,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:50:14,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:50:14,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:50:14,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:50:14,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:50:14,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:50:14,649 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2025-03-08 06:50:14,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:50:14,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:50:14,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:50:14,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:14 BoogieIcfgContainer [2025-03-08 06:50:14,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:50:14,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:50:14,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:50:14,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:50:14,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:50:05" (1/3) ... [2025-03-08 06:50:14,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c65837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:14, skipping insertion in model container [2025-03-08 06:50:14,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:07" (2/3) ... [2025-03-08 06:50:14,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c65837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:14, skipping insertion in model container [2025-03-08 06:50:14,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:14" (3/3) ... [2025-03-08 06:50:14,715 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-1.c [2025-03-08 06:50:14,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:50:14,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.11.cil-1.c that has 8 procedures, 2546 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 06:50:14,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:50:14,825 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;@573a0e2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:50:14,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:50:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 06:50:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:14,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:14,848 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] [2025-03-08 06:50:14,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:14,852 INFO L85 PathProgramCache]: Analyzing trace with hash -232489455, now seen corresponding path program 1 times [2025-03-08 06:50:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278380765] [2025-03-08 06:50:14,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:15,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278380765] [2025-03-08 06:50:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278380765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441875168] [2025-03-08 06:50:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:15,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:15,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:15,415 INFO L87 Difference]: Start difference. First operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:16,236 INFO L93 Difference]: Finished difference Result 5457 states and 9945 transitions. [2025-03-08 06:50:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:50:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:16,267 INFO L225 Difference]: With dead ends: 5457 [2025-03-08 06:50:16,269 INFO L226 Difference]: Without dead ends: 2860 [2025-03-08 06:50:16,280 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-03-08 06:50:16,283 INFO L435 NwaCegarLoop]: 4467 mSDtfsCounter, 5103 mSDsluCounter, 9180 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5122 SdHoareTripleChecker+Valid, 13647 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:16,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5122 Valid, 13647 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2025-03-08 06:50:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2831. [2025-03-08 06:50:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2769 states have (on average 1.8031780426146624) internal successors, (4993), 2773 states have internal predecessors, (4993), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:50:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5086 transitions. [2025-03-08 06:50:16,419 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5086 transitions. Word has length 166 [2025-03-08 06:50:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5086 transitions. [2025-03-08 06:50:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5086 transitions. [2025-03-08 06:50:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:16,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:16,426 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] [2025-03-08 06:50:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:50:16,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 60727567, now seen corresponding path program 1 times [2025-03-08 06:50:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:16,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15065244] [2025-03-08 06:50:16,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:16,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:16,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15065244] [2025-03-08 06:50:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15065244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124479927] [2025-03-08 06:50:16,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:16,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:16,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:16,645 INFO L87 Difference]: Start difference. First operand 2831 states and 5086 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:16,998 INFO L93 Difference]: Finished difference Result 3594 states and 6323 transitions. [2025-03-08 06:50:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:17,010 INFO L225 Difference]: With dead ends: 3594 [2025-03-08 06:50:17,010 INFO L226 Difference]: Without dead ends: 2903 [2025-03-08 06:50:17,013 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-03-08 06:50:17,014 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4723 mSDsluCounter, 8623 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4742 SdHoareTripleChecker+Valid, 13009 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:17,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4742 Valid, 13009 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:50:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2025-03-08 06:50:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2831. [2025-03-08 06:50:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2769 states have (on average 1.802455760202239) internal successors, (4991), 2773 states have internal predecessors, (4991), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:50:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5084 transitions. [2025-03-08 06:50:17,079 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5084 transitions. Word has length 166 [2025-03-08 06:50:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:17,079 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5084 transitions. [2025-03-08 06:50:17,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5084 transitions. [2025-03-08 06:50:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:17,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:17,081 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] [2025-03-08 06:50:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:50:17,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1873478832, now seen corresponding path program 1 times [2025-03-08 06:50:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18645156] [2025-03-08 06:50:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:17,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18645156] [2025-03-08 06:50:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18645156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548944277] [2025-03-08 06:50:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:17,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:17,261 INFO L87 Difference]: Start difference. First operand 2831 states and 5084 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:18,056 INFO L93 Difference]: Finished difference Result 3970 states and 6919 transitions. [2025-03-08 06:50:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:18,074 INFO L225 Difference]: With dead ends: 3970 [2025-03-08 06:50:18,074 INFO L226 Difference]: Without dead ends: 3279 [2025-03-08 06:50:18,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:18,078 INFO L435 NwaCegarLoop]: 4695 mSDtfsCounter, 5035 mSDsluCounter, 14130 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5054 SdHoareTripleChecker+Valid, 18825 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:18,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5054 Valid, 18825 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-08 06:50:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3158. [2025-03-08 06:50:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 3069 states have (on average 1.77940697295536) internal successors, (5461), 3074 states have internal predecessors, (5461), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-08 06:50:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 5597 transitions. [2025-03-08 06:50:18,177 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 5597 transitions. Word has length 166 [2025-03-08 06:50:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:18,177 INFO L471 AbstractCegarLoop]: Abstraction has 3158 states and 5597 transitions. [2025-03-08 06:50:18,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 5597 transitions. [2025-03-08 06:50:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:18,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:18,180 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] [2025-03-08 06:50:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:50:18,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash 3790063, now seen corresponding path program 1 times [2025-03-08 06:50:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016421790] [2025-03-08 06:50:18,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:18,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:18,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:18,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:18,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016421790] [2025-03-08 06:50:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016421790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:18,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:18,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081904467] [2025-03-08 06:50:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:18,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:18,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:18,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:18,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:18,371 INFO L87 Difference]: Start difference. First operand 3158 states and 5597 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:19,152 INFO L93 Difference]: Finished difference Result 5012 states and 8579 transitions. [2025-03-08 06:50:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:19,168 INFO L225 Difference]: With dead ends: 5012 [2025-03-08 06:50:19,168 INFO L226 Difference]: Without dead ends: 3994 [2025-03-08 06:50:19,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:19,174 INFO L435 NwaCegarLoop]: 4691 mSDtfsCounter, 5030 mSDsluCounter, 14118 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5049 SdHoareTripleChecker+Valid, 18809 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:19,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5049 Valid, 18809 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2025-03-08 06:50:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3855. [2025-03-08 06:50:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3710 states have (on average 1.7466307277628033) internal successors, (6480), 3719 states have internal predecessors, (6480), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-08 06:50:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 6708 transitions. [2025-03-08 06:50:19,314 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 6708 transitions. Word has length 166 [2025-03-08 06:50:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:19,314 INFO L471 AbstractCegarLoop]: Abstraction has 3855 states and 6708 transitions. [2025-03-08 06:50:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 6708 transitions. [2025-03-08 06:50:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:19,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:19,318 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] [2025-03-08 06:50:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:50:19,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:19,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash -74200208, now seen corresponding path program 1 times [2025-03-08 06:50:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351186674] [2025-03-08 06:50:19,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:19,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:19,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:19,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:19,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351186674] [2025-03-08 06:50:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351186674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:19,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753640510] [2025-03-08 06:50:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:19,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:19,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:19,484 INFO L87 Difference]: Start difference. First operand 3855 states and 6708 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:20,233 INFO L93 Difference]: Finished difference Result 7263 states and 12236 transitions. [2025-03-08 06:50:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:20,254 INFO L225 Difference]: With dead ends: 7263 [2025-03-08 06:50:20,255 INFO L226 Difference]: Without dead ends: 5548 [2025-03-08 06:50:20,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:20,262 INFO L435 NwaCegarLoop]: 4688 mSDtfsCounter, 5025 mSDsluCounter, 14109 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 18797 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:20,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 18797 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-03-08 06:50:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5372. [2025-03-08 06:50:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 5109 states have (on average 1.7114895282834215) internal successors, (8744), 5132 states have internal predecessors, (8744), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-08 06:50:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 9180 transitions. [2025-03-08 06:50:20,517 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 9180 transitions. Word has length 166 [2025-03-08 06:50:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:20,517 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 9180 transitions. [2025-03-08 06:50:20,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 9180 transitions. [2025-03-08 06:50:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:20,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:20,521 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] [2025-03-08 06:50:20,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:50:20,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2016378673, now seen corresponding path program 1 times [2025-03-08 06:50:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:20,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056902868] [2025-03-08 06:50:20,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:20,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:20,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:20,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:20,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-03-08 06:50:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056902868] [2025-03-08 06:50:20,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056902868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:20,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:20,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844209182] [2025-03-08 06:50:20,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:20,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:20,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:20,666 INFO L87 Difference]: Start difference. First operand 5372 states and 9180 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:21,407 INFO L93 Difference]: Finished difference Result 12238 states and 20538 transitions. [2025-03-08 06:50:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:21,442 INFO L225 Difference]: With dead ends: 12238 [2025-03-08 06:50:21,442 INFO L226 Difference]: Without dead ends: 9006 [2025-03-08 06:50:21,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:21,456 INFO L435 NwaCegarLoop]: 4685 mSDtfsCounter, 5020 mSDsluCounter, 14100 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5039 SdHoareTripleChecker+Valid, 18785 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:21,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5039 Valid, 18785 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9006 states. [2025-03-08 06:50:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9006 to 8757. [2025-03-08 06:50:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6888349514563106) internal successors, (13916), 8309 states have internal predecessors, (13916), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:50:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14864 transitions. [2025-03-08 06:50:21,666 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14864 transitions. Word has length 166 [2025-03-08 06:50:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14864 transitions. [2025-03-08 06:50:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14864 transitions. [2025-03-08 06:50:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:21,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:21,672 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] [2025-03-08 06:50:21,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:50:21,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1384653712, now seen corresponding path program 1 times [2025-03-08 06:50:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:21,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156112560] [2025-03-08 06:50:21,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:21,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:21,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:21,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:21,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156112560] [2025-03-08 06:50:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156112560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:21,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069706039] [2025-03-08 06:50:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:21,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:21,789 INFO L87 Difference]: Start difference. First operand 8757 states and 14864 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:22,268 INFO L93 Difference]: Finished difference Result 16868 states and 28768 transitions. [2025-03-08 06:50:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:22,300 INFO L225 Difference]: With dead ends: 16868 [2025-03-08 06:50:22,300 INFO L226 Difference]: Without dead ends: 10251 [2025-03-08 06:50:22,318 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-03-08 06:50:22,319 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 4715 mSDsluCounter, 8598 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 12971 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:22,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 12971 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:50:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2025-03-08 06:50:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8757. [2025-03-08 06:50:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6867718446601943) internal successors, (13899), 8309 states have internal predecessors, (13899), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:50:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14847 transitions. [2025-03-08 06:50:22,583 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14847 transitions. Word has length 166 [2025-03-08 06:50:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:22,583 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14847 transitions. [2025-03-08 06:50:22,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14847 transitions. [2025-03-08 06:50:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:22,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:22,589 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] [2025-03-08 06:50:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:50:22,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1419477649, now seen corresponding path program 1 times [2025-03-08 06:50:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285581444] [2025-03-08 06:50:22,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:22,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:22,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:22,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:22,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:22,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-03-08 06:50:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285581444] [2025-03-08 06:50:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285581444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:22,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979063192] [2025-03-08 06:50:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:22,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:22,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:22,701 INFO L87 Difference]: Start difference. First operand 8757 states and 14847 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:23,123 INFO L93 Difference]: Finished difference Result 16785 states and 28568 transitions. [2025-03-08 06:50:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:23,153 INFO L225 Difference]: With dead ends: 16785 [2025-03-08 06:50:23,153 INFO L226 Difference]: Without dead ends: 10168 [2025-03-08 06:50:23,171 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-03-08 06:50:23,171 INFO L435 NwaCegarLoop]: 4370 mSDtfsCounter, 4712 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12963 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:23,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12963 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10168 states. [2025-03-08 06:50:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10168 to 8757. [2025-03-08 06:50:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6847087378640777) internal successors, (13882), 8309 states have internal predecessors, (13882), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:50:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14830 transitions. [2025-03-08 06:50:23,447 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14830 transitions. Word has length 166 [2025-03-08 06:50:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14830 transitions. [2025-03-08 06:50:23,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14830 transitions. [2025-03-08 06:50:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:23,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:23,452 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] [2025-03-08 06:50:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:50:23,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -519061648, now seen corresponding path program 1 times [2025-03-08 06:50:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615904436] [2025-03-08 06:50:23,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:23,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:23,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615904436] [2025-03-08 06:50:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615904436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517611648] [2025-03-08 06:50:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:23,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:23,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:23,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:23,573 INFO L87 Difference]: Start difference. First operand 8757 states and 14830 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:24,494 INFO L93 Difference]: Finished difference Result 23233 states and 39382 transitions. [2025-03-08 06:50:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:24,545 INFO L225 Difference]: With dead ends: 23233 [2025-03-08 06:50:24,546 INFO L226 Difference]: Without dead ends: 16616 [2025-03-08 06:50:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:24,564 INFO L435 NwaCegarLoop]: 4668 mSDtfsCounter, 4996 mSDsluCounter, 14053 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 18721 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:24,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 18721 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16616 states. [2025-03-08 06:50:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16616 to 16283. [2025-03-08 06:50:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6795580110497237) internal successors, (25536), 15419 states have internal predecessors, (25536), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:50:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27892 transitions. [2025-03-08 06:50:25,106 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27892 transitions. Word has length 166 [2025-03-08 06:50:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:25,107 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27892 transitions. [2025-03-08 06:50:25,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27892 transitions. [2025-03-08 06:50:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:25,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:25,115 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] [2025-03-08 06:50:25,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:50:25,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:25,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1967068495, now seen corresponding path program 1 times [2025-03-08 06:50:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:25,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357532511] [2025-03-08 06:50:25,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:25,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:25,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:25,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:25,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357532511] [2025-03-08 06:50:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357532511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710864653] [2025-03-08 06:50:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:25,210 INFO L87 Difference]: Start difference. First operand 16283 states and 27892 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:25,896 INFO L93 Difference]: Finished difference Result 34101 states and 59500 transitions. [2025-03-08 06:50:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:25,963 INFO L225 Difference]: With dead ends: 34101 [2025-03-08 06:50:25,963 INFO L226 Difference]: Without dead ends: 19958 [2025-03-08 06:50:25,995 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-03-08 06:50:25,996 INFO L435 NwaCegarLoop]: 4365 mSDtfsCounter, 4708 mSDsluCounter, 8584 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12949 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:25,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12949 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19958 states. [2025-03-08 06:50:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19958 to 16283. [2025-03-08 06:50:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6773875295974743) internal successors, (25503), 15419 states have internal predecessors, (25503), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:50:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27859 transitions. [2025-03-08 06:50:26,463 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27859 transitions. Word has length 166 [2025-03-08 06:50:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27859 transitions. [2025-03-08 06:50:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27859 transitions. [2025-03-08 06:50:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:26,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:26,470 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] [2025-03-08 06:50:26,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:50:26,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash -628305072, now seen corresponding path program 1 times [2025-03-08 06:50:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504663858] [2025-03-08 06:50:26,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:26,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:26,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:26,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:26,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504663858] [2025-03-08 06:50:26,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504663858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:26,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:26,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637320310] [2025-03-08 06:50:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:26,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:26,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:26,629 INFO L87 Difference]: Start difference. First operand 16283 states and 27859 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:27,241 INFO L93 Difference]: Finished difference Result 33856 states and 58944 transitions. [2025-03-08 06:50:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:27,311 INFO L225 Difference]: With dead ends: 33856 [2025-03-08 06:50:27,312 INFO L226 Difference]: Without dead ends: 19713 [2025-03-08 06:50:27,348 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-03-08 06:50:27,349 INFO L435 NwaCegarLoop]: 4362 mSDtfsCounter, 4705 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12941 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:27,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12941 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2025-03-08 06:50:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 16283. [2025-03-08 06:50:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6752170481452249) internal successors, (25470), 15419 states have internal predecessors, (25470), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:50:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27826 transitions. [2025-03-08 06:50:27,909 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27826 transitions. Word has length 166 [2025-03-08 06:50:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:27,910 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27826 transitions. [2025-03-08 06:50:27,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27826 transitions. [2025-03-08 06:50:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:27,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:27,917 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] [2025-03-08 06:50:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:50:27,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -446571823, now seen corresponding path program 1 times [2025-03-08 06:50:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460723992] [2025-03-08 06:50:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:27,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:27,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460723992] [2025-03-08 06:50:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460723992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578028042] [2025-03-08 06:50:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:28,030 INFO L87 Difference]: Start difference. First operand 16283 states and 27826 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:29,715 INFO L93 Difference]: Finished difference Result 50449 states and 87465 transitions. [2025-03-08 06:50:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:29,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:29,860 INFO L225 Difference]: With dead ends: 50449 [2025-03-08 06:50:29,860 INFO L226 Difference]: Without dead ends: 36306 [2025-03-08 06:50:29,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:29,916 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 5319 mSDsluCounter, 14005 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 18658 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:29,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 18658 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36306 states. [2025-03-08 06:50:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36306 to 33102. [2025-03-08 06:50:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.685917644382333) internal successors, (51874), 31438 states have internal predecessors, (51874), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:50:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58518 transitions. [2025-03-08 06:50:31,193 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58518 transitions. Word has length 166 [2025-03-08 06:50:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:31,193 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58518 transitions. [2025-03-08 06:50:31,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58518 transitions. [2025-03-08 06:50:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:31,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:31,204 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] [2025-03-08 06:50:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:50:31,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash -302162128, now seen corresponding path program 1 times [2025-03-08 06:50:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693455165] [2025-03-08 06:50:31,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:31,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:31,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:31,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:31,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:31,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693455165] [2025-03-08 06:50:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693455165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180757762] [2025-03-08 06:50:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:31,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:31,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:31,292 INFO L87 Difference]: Start difference. First operand 33102 states and 58518 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:32,541 INFO L93 Difference]: Finished difference Result 72836 states and 132624 transitions. [2025-03-08 06:50:32,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:32,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:32,710 INFO L225 Difference]: With dead ends: 72836 [2025-03-08 06:50:32,710 INFO L226 Difference]: Without dead ends: 41874 [2025-03-08 06:50:32,789 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-03-08 06:50:32,790 INFO L435 NwaCegarLoop]: 4357 mSDtfsCounter, 4699 mSDsluCounter, 8568 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4718 SdHoareTripleChecker+Valid, 12925 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:32,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4718 Valid, 12925 Invalid, 458 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41874 states. [2025-03-08 06:50:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41874 to 33102. [2025-03-08 06:50:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.683805128538464) internal successors, (51809), 31438 states have internal predecessors, (51809), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:50:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58453 transitions. [2025-03-08 06:50:34,097 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58453 transitions. Word has length 166 [2025-03-08 06:50:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:34,097 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58453 transitions. [2025-03-08 06:50:34,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58453 transitions. [2025-03-08 06:50:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:34,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:34,107 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] [2025-03-08 06:50:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:50:34,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:34,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash -574598415, now seen corresponding path program 1 times [2025-03-08 06:50:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595989075] [2025-03-08 06:50:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:34,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:34,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:34,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:34,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595989075] [2025-03-08 06:50:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595989075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:34,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:34,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514268773] [2025-03-08 06:50:34,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:34,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:34,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:34,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:34,367 INFO L87 Difference]: Start difference. First operand 33102 states and 58453 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:36,461 INFO L93 Difference]: Finished difference Result 71374 states and 129570 transitions. [2025-03-08 06:50:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:36,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:36,583 INFO L225 Difference]: With dead ends: 71374 [2025-03-08 06:50:36,583 INFO L226 Difference]: Without dead ends: 40412 [2025-03-08 06:50:36,634 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-03-08 06:50:36,635 INFO L435 NwaCegarLoop]: 4352 mSDtfsCounter, 4695 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4714 SdHoareTripleChecker+Valid, 12911 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:36,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4714 Valid, 12911 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:50:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40412 states. [2025-03-08 06:50:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40412 to 33102. [2025-03-08 06:50:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.6816926126945952) internal successors, (51744), 31438 states have internal predecessors, (51744), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:50:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58388 transitions. [2025-03-08 06:50:37,973 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58388 transitions. Word has length 166 [2025-03-08 06:50:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:37,973 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58388 transitions. [2025-03-08 06:50:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58388 transitions. [2025-03-08 06:50:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:37,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:37,983 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] [2025-03-08 06:50:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:50:37,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:37,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1048624398, now seen corresponding path program 1 times [2025-03-08 06:50:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:37,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873743362] [2025-03-08 06:50:37,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:37,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:37,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873743362] [2025-03-08 06:50:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873743362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:38,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733151472] [2025-03-08 06:50:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:38,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:38,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:38,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:38,065 INFO L87 Difference]: Start difference. First operand 33102 states and 58388 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:39,650 INFO L93 Difference]: Finished difference Result 70643 states and 127978 transitions. [2025-03-08 06:50:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:39,803 INFO L225 Difference]: With dead ends: 70643 [2025-03-08 06:50:39,803 INFO L226 Difference]: Without dead ends: 39681 [2025-03-08 06:50:39,883 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-03-08 06:50:39,884 INFO L435 NwaCegarLoop]: 4349 mSDtfsCounter, 4692 mSDsluCounter, 8554 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 12903 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:39,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 12903 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39681 states. [2025-03-08 06:50:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39681 to 33102. [2025-03-08 06:50:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.6795800968507264) internal successors, (51679), 31438 states have internal predecessors, (51679), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:50:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58323 transitions. [2025-03-08 06:50:41,802 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58323 transitions. Word has length 166 [2025-03-08 06:50:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:41,803 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58323 transitions. [2025-03-08 06:50:41,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58323 transitions. [2025-03-08 06:50:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:41,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:41,812 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] [2025-03-08 06:50:41,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:50:41,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1341010223, now seen corresponding path program 1 times [2025-03-08 06:50:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005479558] [2025-03-08 06:50:41,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:41,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:41,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:41,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:41,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005479558] [2025-03-08 06:50:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005479558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582418675] [2025-03-08 06:50:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:41,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:41,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:41,924 INFO L87 Difference]: Start difference. First operand 33102 states and 58323 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:44,550 INFO L93 Difference]: Finished difference Result 104044 states and 189918 transitions. [2025-03-08 06:50:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 06:50:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:44,886 INFO L225 Difference]: With dead ends: 104044 [2025-03-08 06:50:44,886 INFO L226 Difference]: Without dead ends: 73082 [2025-03-08 06:50:45,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:45,026 INFO L435 NwaCegarLoop]: 4631 mSDtfsCounter, 5137 mSDsluCounter, 13944 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 18575 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:45,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 18575 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73082 states. [2025-03-08 06:50:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73082 to 69317. [2025-03-08 06:50:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69317 states, 64022 states have (on average 1.6882790290837524) internal successors, (108087), 66085 states have internal predecessors, (108087), 2459 states have call successors, (2459), 775 states have call predecessors, (2459), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-08 06:50:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69317 states to 69317 states and 129387 transitions. [2025-03-08 06:50:48,087 INFO L78 Accepts]: Start accepts. Automaton has 69317 states and 129387 transitions. Word has length 166 [2025-03-08 06:50:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 69317 states and 129387 transitions. [2025-03-08 06:50:48,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 69317 states and 129387 transitions. [2025-03-08 06:50:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:50:48,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:48,103 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] [2025-03-08 06:50:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:50:48,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 589220626, now seen corresponding path program 1 times [2025-03-08 06:50:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026960556] [2025-03-08 06:50:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:48,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:50:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:50:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026960556] [2025-03-08 06:50:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026960556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86644431] [2025-03-08 06:50:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:48,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:48,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:48,174 INFO L87 Difference]: Start difference. First operand 69317 states and 129387 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)