./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label46+token_ring.12.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 8f86f2fbff11a0ee7c52360384354edd19538e6bc949aea04301001498242d90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:04:32,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:04:32,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:04:32,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:04:32,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:04:32,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:04:32,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:04:32,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:04:32,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:04:32,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:04:32,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:04:32,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:04:32,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:04:32,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:04:32,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:04:32,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:04:32,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:04:32,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:04:32,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:04:32,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:32,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:04:32,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:04:32,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:04:32,951 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 -> 8f86f2fbff11a0ee7c52360384354edd19538e6bc949aea04301001498242d90 [2025-03-16 20:04:33,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:04:33,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:04:33,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:04:33,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:04:33,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:04:33,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.12.cil-1.c [2025-03-16 20:04:34,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946ced5a0/c9616d13bf1f43b29a1b5f0f60893de8/FLAG332af6f9e [2025-03-16 20:04:34,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:04:34,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.12.cil-1.c [2025-03-16 20:04:35,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946ced5a0/c9616d13bf1f43b29a1b5f0f60893de8/FLAG332af6f9e [2025-03-16 20:04:35,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946ced5a0/c9616d13bf1f43b29a1b5f0f60893de8 [2025-03-16 20:04:35,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:04:35,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:04:35,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:35,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:04:35,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:04:35,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:35" (1/1) ... [2025-03-16 20:04:35,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f4d50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:35, skipping insertion in model container [2025-03-16 20:04:35,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:35" (1/1) ... [2025-03-16 20:04:35,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:04:36,337 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_label46+token_ring.12.cil-1.c[382357,382370] [2025-03-16 20:04:36,364 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_label46+token_ring.12.cil-1.c[383339,383352] [2025-03-16 20:04:36,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:36,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:04:37,185 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_label46+token_ring.12.cil-1.c[382357,382370] [2025-03-16 20:04:37,189 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_label46+token_ring.12.cil-1.c[383339,383352] [2025-03-16 20:04:37,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:37,257 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:04:37,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37 WrapperNode [2025-03-16 20:04:37,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:37,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:37,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:04:37,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:04:37,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,697 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13191 [2025-03-16 20:04:37,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:37,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:04:37,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:04:37,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:04:37,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,822 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-16 20:04:37,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:37,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:38,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:04:38,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:04:38,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:04:38,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:04:38,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (1/1) ... [2025-03-16 20:04:38,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:38,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:38,129 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-16 20:04:38,134 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-16 20:04:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:04:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:04:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:04:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:04:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:04:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:04:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:04:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:04:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:04:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:04:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:04:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:04:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:04:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:04:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:04:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:04:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:04:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:04:38,251 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:04:38,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:04:44,333 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:04:44,334 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:04:44,335 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:04:44,335 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:04:44,335 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:04:44,335 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:04:44,336 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:04:44,559 INFO L? ?]: Removed 1744 outVars from TransFormulas that were not future-live. [2025-03-16 20:04:44,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:04:44,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:04:44,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:04:44,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:44 BoogieIcfgContainer [2025-03-16 20:04:44,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:04:44,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:04:44,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:04:44,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:04:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:04:35" (1/3) ... [2025-03-16 20:04:44,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668a346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:44, skipping insertion in model container [2025-03-16 20:04:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:37" (2/3) ... [2025-03-16 20:04:44,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668a346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:44, skipping insertion in model container [2025-03-16 20:04:44,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:44" (3/3) ... [2025-03-16 20:04:44,720 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.12.cil-1.c [2025-03-16 20:04:44,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:04:44,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.12.cil-1.c that has 8 procedures, 2493 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-16 20:04:44,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:04:44,889 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;@1d847729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:04:44,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:04:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 2493 states, 2456 states have (on average 1.863599348534202) internal successors, (4577), 2460 states have internal predecessors, (4577), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 20:04:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:44,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:44,919 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] [2025-03-16 20:04:44,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1234650791, now seen corresponding path program 1 times [2025-03-16 20:04:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074555532] [2025-03-16 20:04:44,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:45,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:45,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:45,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:45,393 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-16 20:04:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074555532] [2025-03-16 20:04:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074555532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:45,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:45,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:04:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422113114] [2025-03-16 20:04:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:45,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:45,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:45,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:45,426 INFO L87 Difference]: Start difference. First operand has 2493 states, 2456 states have (on average 1.863599348534202) internal successors, (4577), 2460 states have internal predecessors, (4577), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:45,603 INFO L93 Difference]: Finished difference Result 4979 states and 9253 transitions. [2025-03-16 20:04:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2025-03-16 20:04:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:45,634 INFO L225 Difference]: With dead ends: 4979 [2025-03-16 20:04:45,635 INFO L226 Difference]: Without dead ends: 2486 [2025-03-16 20:04:45,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:45,648 INFO L435 NwaCegarLoop]: 4552 mSDtfsCounter, 585 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 8513 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:45,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 8513 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-16 20:04:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-16 20:04:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2450 states have (on average 1.833061224489796) internal successors, (4491), 2453 states have internal predecessors, (4491), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:04:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4545 transitions. [2025-03-16 20:04:45,777 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4545 transitions. Word has length 162 [2025-03-16 20:04:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:45,779 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4545 transitions. [2025-03-16 20:04:45,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4545 transitions. [2025-03-16 20:04:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:45,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:45,785 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] [2025-03-16 20:04:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:04:45,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:45,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1937246630, now seen corresponding path program 1 times [2025-03-16 20:04:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500760243] [2025-03-16 20:04:45,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:45,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:45,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:45,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500760243] [2025-03-16 20:04:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500760243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:04:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801317801] [2025-03-16 20:04:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:45,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:45,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:45,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:45,937 INFO L87 Difference]: Start difference. First operand 2486 states and 4545 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:46,001 INFO L93 Difference]: Finished difference Result 2836 states and 5105 transitions. [2025-03-16 20:04:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2025-03-16 20:04:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:46,013 INFO L225 Difference]: With dead ends: 2836 [2025-03-16 20:04:46,014 INFO L226 Difference]: Without dead ends: 2486 [2025-03-16 20:04:46,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:46,016 INFO L435 NwaCegarLoop]: 4543 mSDtfsCounter, 572 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:46,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 8500 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-16 20:04:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-16 20:04:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2450 states have (on average 1.8326530612244898) internal successors, (4490), 2453 states have internal predecessors, (4490), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:04:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4544 transitions. [2025-03-16 20:04:46,073 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4544 transitions. Word has length 162 [2025-03-16 20:04:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:46,073 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4544 transitions. [2025-03-16 20:04:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4544 transitions. [2025-03-16 20:04:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:46,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:46,077 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] [2025-03-16 20:04:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:04:46,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:46,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash 988756901, now seen corresponding path program 1 times [2025-03-16 20:04:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917360852] [2025-03-16 20:04:46,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:46,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:46,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:46,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:46,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:46,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-16 20:04:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917360852] [2025-03-16 20:04:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917360852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:46,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087501007] [2025-03-16 20:04:46,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:46,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:46,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:46,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:46,291 INFO L87 Difference]: Start difference. First operand 2486 states and 4544 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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-16 20:04:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:46,921 INFO L93 Difference]: Finished difference Result 3229 states and 5753 transitions. [2025-03-16 20:04:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:04:46,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:46,934 INFO L225 Difference]: With dead ends: 3229 [2025-03-16 20:04:46,934 INFO L226 Difference]: Without dead ends: 2882 [2025-03-16 20:04:46,936 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-16 20:04:46,938 INFO L435 NwaCegarLoop]: 4422 mSDtfsCounter, 5079 mSDsluCounter, 9103 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 13525 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:46,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 13525 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-16 20:04:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2851. [2025-03-16 20:04:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2787 states have (on average 1.8083961248654468) internal successors, (5040), 2791 states have internal predecessors, (5040), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:04:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5137 transitions. [2025-03-16 20:04:47,100 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5137 transitions. Word has length 162 [2025-03-16 20:04:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:47,101 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5137 transitions. [2025-03-16 20:04:47,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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-16 20:04:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5137 transitions. [2025-03-16 20:04:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:47,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:47,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] [2025-03-16 20:04:47,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:04:47,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:47,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash -113927291, now seen corresponding path program 1 times [2025-03-16 20:04:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554262197] [2025-03-16 20:04:47,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:47,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:47,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:47,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:47,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:47,300 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-16 20:04:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:47,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554262197] [2025-03-16 20:04:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554262197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:47,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411739151] [2025-03-16 20:04:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:47,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:47,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:47,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:47,302 INFO L87 Difference]: Start difference. First operand 2851 states and 5137 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:47,648 INFO L93 Difference]: Finished difference Result 3641 states and 6439 transitions. [2025-03-16 20:04:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:47,658 INFO L225 Difference]: With dead ends: 3641 [2025-03-16 20:04:47,659 INFO L226 Difference]: Without dead ends: 2929 [2025-03-16 20:04:47,661 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-16 20:04:47,662 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4752 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 13077 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:47,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 13077 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2025-03-16 20:04:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2851. [2025-03-16 20:04:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2787 states have (on average 1.8076785073555794) internal successors, (5038), 2791 states have internal predecessors, (5038), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:04:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5135 transitions. [2025-03-16 20:04:47,724 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5135 transitions. Word has length 162 [2025-03-16 20:04:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:47,724 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5135 transitions. [2025-03-16 20:04:47,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5135 transitions. [2025-03-16 20:04:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:47,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:47,726 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] [2025-03-16 20:04:47,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:04:47,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:47,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2056105756, now seen corresponding path program 1 times [2025-03-16 20:04:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718592665] [2025-03-16 20:04:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:47,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:47,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:47,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:47,882 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-16 20:04:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718592665] [2025-03-16 20:04:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718592665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013714340] [2025-03-16 20:04:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:47,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:47,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:47,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:47,884 INFO L87 Difference]: Start difference. First operand 2851 states and 5135 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:48,679 INFO L93 Difference]: Finished difference Result 4031 states and 7068 transitions. [2025-03-16 20:04:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:48,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:48,699 INFO L225 Difference]: With dead ends: 4031 [2025-03-16 20:04:48,699 INFO L226 Difference]: Without dead ends: 3319 [2025-03-16 20:04:48,702 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-16 20:04:48,702 INFO L435 NwaCegarLoop]: 4743 mSDtfsCounter, 5080 mSDsluCounter, 14281 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 19024 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:48,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 19024 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:04:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-03-16 20:04:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3188. [2025-03-16 20:04:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 3096 states have (on average 1.7864987080103358) internal successors, (5531), 3101 states have internal predecessors, (5531), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-16 20:04:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5673 transitions. [2025-03-16 20:04:48,795 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5673 transitions. Word has length 162 [2025-03-16 20:04:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:48,796 INFO L471 AbstractCegarLoop]: Abstraction has 3188 states and 5673 transitions. [2025-03-16 20:04:48,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5673 transitions. [2025-03-16 20:04:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:48,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:48,798 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] [2025-03-16 20:04:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:04:48,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1344926629, now seen corresponding path program 1 times [2025-03-16 20:04:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470309381] [2025-03-16 20:04:48,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:48,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:48,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:48,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:48,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:48,976 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-16 20:04:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470309381] [2025-03-16 20:04:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470309381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:48,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180691567] [2025-03-16 20:04:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:48,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:48,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:48,979 INFO L87 Difference]: Start difference. First operand 3188 states and 5673 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:49,738 INFO L93 Difference]: Finished difference Result 5109 states and 8815 transitions. [2025-03-16 20:04:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:49,756 INFO L225 Difference]: With dead ends: 5109 [2025-03-16 20:04:49,756 INFO L226 Difference]: Without dead ends: 4060 [2025-03-16 20:04:49,760 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-16 20:04:49,762 INFO L435 NwaCegarLoop]: 4739 mSDtfsCounter, 5075 mSDsluCounter, 14269 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 19008 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:49,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 19008 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2025-03-16 20:04:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3909. [2025-03-16 20:04:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3759 states have (on average 1.7568502261239691) internal successors, (6604), 3768 states have internal predecessors, (6604), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-16 20:04:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 6842 transitions. [2025-03-16 20:04:49,878 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 6842 transitions. Word has length 162 [2025-03-16 20:04:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:49,878 INFO L471 AbstractCegarLoop]: Abstraction has 3909 states and 6842 transitions. [2025-03-16 20:04:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 6842 transitions. [2025-03-16 20:04:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:49,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:49,881 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] [2025-03-16 20:04:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:04:49,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:49,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1870498620, now seen corresponding path program 1 times [2025-03-16 20:04:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823539319] [2025-03-16 20:04:49,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:49,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:49,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:50,028 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-16 20:04:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823539319] [2025-03-16 20:04:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823539319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937763725] [2025-03-16 20:04:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:50,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:50,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:50,030 INFO L87 Difference]: Start difference. First operand 3909 states and 6842 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:50,756 INFO L93 Difference]: Finished difference Result 7448 states and 12678 transitions. [2025-03-16 20:04:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:50,784 INFO L225 Difference]: With dead ends: 7448 [2025-03-16 20:04:50,785 INFO L226 Difference]: Without dead ends: 5678 [2025-03-16 20:04:50,790 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-16 20:04:50,791 INFO L435 NwaCegarLoop]: 4736 mSDtfsCounter, 5070 mSDsluCounter, 14260 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5090 SdHoareTripleChecker+Valid, 18996 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5090 Valid, 18996 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2025-03-16 20:04:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5486. [2025-03-16 20:04:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 5214 states have (on average 1.7261219792865363) internal successors, (9000), 5237 states have internal predecessors, (9000), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-16 20:04:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 9454 transitions. [2025-03-16 20:04:50,932 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 9454 transitions. Word has length 162 [2025-03-16 20:04:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:50,933 INFO L471 AbstractCegarLoop]: Abstraction has 5486 states and 9454 transitions. [2025-03-16 20:04:50,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 9454 transitions. [2025-03-16 20:04:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:50,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:50,940 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] [2025-03-16 20:04:50,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:04:50,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1835674683, now seen corresponding path program 1 times [2025-03-16 20:04:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019800336] [2025-03-16 20:04:50,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:50,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:50,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:50,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:50,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:51,079 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-16 20:04:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019800336] [2025-03-16 20:04:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019800336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289605403] [2025-03-16 20:04:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:51,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:51,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:51,082 INFO L87 Difference]: Start difference. First operand 5486 states and 9454 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:51,757 INFO L93 Difference]: Finished difference Result 12647 states and 21488 transitions. [2025-03-16 20:04:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:51,787 INFO L225 Difference]: With dead ends: 12647 [2025-03-16 20:04:51,787 INFO L226 Difference]: Without dead ends: 9300 [2025-03-16 20:04:51,800 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-16 20:04:51,801 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 5102 mSDsluCounter, 13592 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5122 SdHoareTripleChecker+Valid, 18049 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:51,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5122 Valid, 18049 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2025-03-16 20:04:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9027. [2025-03-16 20:04:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9027 states, 8493 states have (on average 1.7082303073119038) internal successors, (14508), 8562 states have internal predecessors, (14508), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-16 20:04:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 15490 transitions. [2025-03-16 20:04:52,048 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 15490 transitions. Word has length 162 [2025-03-16 20:04:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:52,048 INFO L471 AbstractCegarLoop]: Abstraction has 9027 states and 15490 transitions. [2025-03-16 20:04:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 15490 transitions. [2025-03-16 20:04:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:52,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:52,052 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] [2025-03-16 20:04:52,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:04:52,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:52,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash 520753316, now seen corresponding path program 1 times [2025-03-16 20:04:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198283013] [2025-03-16 20:04:52,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:52,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:52,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:52,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:52,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:52,174 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-16 20:04:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:52,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198283013] [2025-03-16 20:04:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198283013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382447434] [2025-03-16 20:04:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:52,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:52,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:52,176 INFO L87 Difference]: Start difference. First operand 9027 states and 15490 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:53,059 INFO L93 Difference]: Finished difference Result 24534 states and 42338 transitions. [2025-03-16 20:04:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:53,121 INFO L225 Difference]: With dead ends: 24534 [2025-03-16 20:04:53,122 INFO L226 Difference]: Without dead ends: 17646 [2025-03-16 20:04:53,144 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-16 20:04:53,145 INFO L435 NwaCegarLoop]: 4730 mSDtfsCounter, 5060 mSDsluCounter, 14242 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5080 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:53,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5080 Valid, 18972 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2025-03-16 20:04:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 17216. [2025-03-16 20:04:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.711872826626925) internal successors, (27568), 16319 states have internal predecessors, (27568), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:04:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29990 transitions. [2025-03-16 20:04:53,722 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29990 transitions. Word has length 162 [2025-03-16 20:04:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:53,723 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29990 transitions. [2025-03-16 20:04:53,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29990 transitions. [2025-03-16 20:04:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:53,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:53,731 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] [2025-03-16 20:04:53,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:04:53,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:53,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash -927253531, now seen corresponding path program 1 times [2025-03-16 20:04:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:53,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99498526] [2025-03-16 20:04:53,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:53,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:53,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:53,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:53,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:53,865 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-16 20:04:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:53,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99498526] [2025-03-16 20:04:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99498526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65514902] [2025-03-16 20:04:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:53,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:53,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:53,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:53,867 INFO L87 Difference]: Start difference. First operand 17216 states and 29990 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:54,559 INFO L93 Difference]: Finished difference Result 37193 states and 66148 transitions. [2025-03-16 20:04:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:54,624 INFO L225 Difference]: With dead ends: 37193 [2025-03-16 20:04:54,625 INFO L226 Difference]: Without dead ends: 22116 [2025-03-16 20:04:54,658 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-16 20:04:54,658 INFO L435 NwaCegarLoop]: 4399 mSDtfsCounter, 4744 mSDsluCounter, 8640 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4764 SdHoareTripleChecker+Valid, 13039 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:54,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4764 Valid, 13039 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22116 states. [2025-03-16 20:04:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22116 to 17216. [2025-03-16 20:04:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.7098236462990561) internal successors, (27535), 16319 states have internal predecessors, (27535), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:04:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29957 transitions. [2025-03-16 20:04:55,221 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29957 transitions. Word has length 162 [2025-03-16 20:04:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:55,222 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29957 transitions. [2025-03-16 20:04:55,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29957 transitions. [2025-03-16 20:04:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:55,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:55,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:55,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:04:55,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 411509892, now seen corresponding path program 1 times [2025-03-16 20:04:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787636684] [2025-03-16 20:04:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:55,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:55,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:55,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:55,330 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-16 20:04:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:55,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787636684] [2025-03-16 20:04:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787636684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780390116] [2025-03-16 20:04:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:55,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:55,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:55,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:55,333 INFO L87 Difference]: Start difference. First operand 17216 states and 29957 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:55,918 INFO L93 Difference]: Finished difference Result 36948 states and 65592 transitions. [2025-03-16 20:04:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:56,057 INFO L225 Difference]: With dead ends: 36948 [2025-03-16 20:04:56,058 INFO L226 Difference]: Without dead ends: 21871 [2025-03-16 20:04:56,077 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-16 20:04:56,078 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4741 mSDsluCounter, 8635 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 13031 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:56,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 13031 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21871 states. [2025-03-16 20:04:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21871 to 17216. [2025-03-16 20:04:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.7077744659711873) internal successors, (27502), 16319 states have internal predecessors, (27502), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:04:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29924 transitions. [2025-03-16 20:04:56,515 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29924 transitions. Word has length 162 [2025-03-16 20:04:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29924 transitions. [2025-03-16 20:04:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29924 transitions. [2025-03-16 20:04:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:56,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:56,577 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] [2025-03-16 20:04:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:04:56,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 593243141, now seen corresponding path program 1 times [2025-03-16 20:04:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116055709] [2025-03-16 20:04:56,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:56,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:56,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:56,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:56,726 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-16 20:04:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116055709] [2025-03-16 20:04:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116055709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:56,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047883341] [2025-03-16 20:04:56,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:56,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:56,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:56,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:56,729 INFO L87 Difference]: Start difference. First operand 17216 states and 29924 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:58,387 INFO L93 Difference]: Finished difference Result 52005 states and 92482 transitions. [2025-03-16 20:04:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:04:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:58,502 INFO L225 Difference]: With dead ends: 52005 [2025-03-16 20:04:58,502 INFO L226 Difference]: Without dead ends: 36928 [2025-03-16 20:04:58,539 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-16 20:04:58,540 INFO L435 NwaCegarLoop]: 4717 mSDtfsCounter, 5039 mSDsluCounter, 14205 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5059 SdHoareTripleChecker+Valid, 18922 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:58,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5059 Valid, 18922 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36928 states. [2025-03-16 20:04:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36928 to 36267. [2025-03-16 20:04:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7259804356178148) internal successors, (58402), 34506 states have internal predecessors, (58402), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:04:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65240 transitions. [2025-03-16 20:04:59,715 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65240 transitions. Word has length 162 [2025-03-16 20:04:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65240 transitions. [2025-03-16 20:04:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:04:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65240 transitions. [2025-03-16 20:04:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:04:59,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:59,727 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] [2025-03-16 20:04:59,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:04:59,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:59,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 737652836, now seen corresponding path program 1 times [2025-03-16 20:04:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629320241] [2025-03-16 20:04:59,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:59,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:04:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:04:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:59,826 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-16 20:04:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629320241] [2025-03-16 20:04:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629320241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139125791] [2025-03-16 20:04:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:59,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:59,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:59,829 INFO L87 Difference]: Start difference. First operand 36267 states and 65240 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:01,132 INFO L93 Difference]: Finished difference Result 82822 states and 153380 transitions. [2025-03-16 20:05:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:05:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:01,308 INFO L225 Difference]: With dead ends: 82822 [2025-03-16 20:05:01,308 INFO L226 Difference]: Without dead ends: 48694 [2025-03-16 20:05:01,390 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-16 20:05:01,391 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4737 mSDsluCounter, 8626 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4757 SdHoareTripleChecker+Valid, 13017 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:01,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4757 Valid, 13017 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:05:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48694 states. [2025-03-16 20:05:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48694 to 36267. [2025-03-16 20:05:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7240594615361882) internal successors, (58337), 34506 states have internal predecessors, (58337), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:05:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65175 transitions. [2025-03-16 20:05:03,389 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65175 transitions. Word has length 162 [2025-03-16 20:05:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:03,389 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65175 transitions. [2025-03-16 20:05:03,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65175 transitions. [2025-03-16 20:05:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:05:03,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:03,400 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] [2025-03-16 20:05:03,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:05:03,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:03,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 465216549, now seen corresponding path program 1 times [2025-03-16 20:05:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681296840] [2025-03-16 20:05:03,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:03,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:05:03,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:05:03,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:03,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:03,500 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-16 20:05:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681296840] [2025-03-16 20:05:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681296840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415718165] [2025-03-16 20:05:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:03,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:03,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:03,503 INFO L87 Difference]: Start difference. First operand 36267 states and 65175 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:05,284 INFO L93 Difference]: Finished difference Result 82091 states and 151788 transitions. [2025-03-16 20:05:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:05:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:05,453 INFO L225 Difference]: With dead ends: 82091 [2025-03-16 20:05:05,453 INFO L226 Difference]: Without dead ends: 47963 [2025-03-16 20:05:05,531 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-16 20:05:05,532 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4734 mSDsluCounter, 8621 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 13009 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:05,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 13009 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:05:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47963 states. [2025-03-16 20:05:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47963 to 36267. [2025-03-16 20:05:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7221384874545616) internal successors, (58272), 34506 states have internal predecessors, (58272), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:05:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65110 transitions. [2025-03-16 20:05:06,997 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65110 transitions. Word has length 162 [2025-03-16 20:05:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:06,997 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65110 transitions. [2025-03-16 20:05:06,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65110 transitions. [2025-03-16 20:05:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:05:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:07,008 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] [2025-03-16 20:05:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:05:07,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:07,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1344687036, now seen corresponding path program 1 times [2025-03-16 20:05:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96469130] [2025-03-16 20:05:07,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:05:07,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:05:07,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:07,104 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-16 20:05:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96469130] [2025-03-16 20:05:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96469130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832683878] [2025-03-16 20:05:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:07,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:07,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:07,106 INFO L87 Difference]: Start difference. First operand 36267 states and 65110 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:08,936 INFO L93 Difference]: Finished difference Result 81360 states and 150196 transitions. [2025-03-16 20:05:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:05:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:09,113 INFO L225 Difference]: With dead ends: 81360 [2025-03-16 20:05:09,113 INFO L226 Difference]: Without dead ends: 47232 [2025-03-16 20:05:09,207 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-16 20:05:09,207 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4731 mSDsluCounter, 8616 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4751 SdHoareTripleChecker+Valid, 13001 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:09,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4751 Valid, 13001 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:05:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47232 states. [2025-03-16 20:05:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47232 to 36267. [2025-03-16 20:05:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.720217513372935) internal successors, (58207), 34506 states have internal predecessors, (58207), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:05:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65045 transitions. [2025-03-16 20:05:11,484 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65045 transitions. Word has length 162 [2025-03-16 20:05:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65045 transitions. [2025-03-16 20:05:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65045 transitions. [2025-03-16 20:05:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:05:11,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:11,495 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] [2025-03-16 20:05:11,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:05:11,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:11,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1818713019, now seen corresponding path program 1 times [2025-03-16 20:05:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:11,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436648350] [2025-03-16 20:05:11,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:11,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:05:11,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:05:11,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:11,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:11,615 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-16 20:05:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436648350] [2025-03-16 20:05:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436648350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:05:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710814585] [2025-03-16 20:05:11,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:05:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:11,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:05:11,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:05:11,619 INFO L87 Difference]: Start difference. First operand 36267 states and 65045 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:14,348 INFO L93 Difference]: Finished difference Result 120162 states and 222716 transitions. [2025-03-16 20:05:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:05:14,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:05:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:14,674 INFO L225 Difference]: With dead ends: 120162 [2025-03-16 20:05:14,674 INFO L226 Difference]: Without dead ends: 86034 [2025-03-16 20:05:14,780 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-16 20:05:14,781 INFO L435 NwaCegarLoop]: 4437 mSDtfsCounter, 5163 mSDsluCounter, 13518 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 17955 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:14,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 17955 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:05:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86034 states. [2025-03-16 20:05:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86034 to 80009. [2025-03-16 20:05:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80009 states, 74521 states have (on average 1.742609465788167) internal successors, (129861), 76584 states have internal predecessors, (129861), 2652 states have call successors, (2652), 775 states have call predecessors, (2652), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-16 20:05:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80009 states to 80009 states and 151547 transitions. [2025-03-16 20:05:17,667 INFO L78 Accepts]: Start accepts. Automaton has 80009 states and 151547 transitions. Word has length 162 [2025-03-16 20:05:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:17,667 INFO L471 AbstractCegarLoop]: Abstraction has 80009 states and 151547 transitions. [2025-03-16 20:05:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 80009 states and 151547 transitions. [2025-03-16 20:05:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:05:17,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:17,684 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] [2025-03-16 20:05:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:05:17,684 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2111098844, now seen corresponding path program 1 times [2025-03-16 20:05:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123857284] [2025-03-16 20:05:17,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:17,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:05:17,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:05:17,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:17,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:05:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123857284] [2025-03-16 20:05:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123857284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:17,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:17,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435799299] [2025-03-16 20:05:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:17,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:17,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:17,757 INFO L87 Difference]: Start difference. First operand 80009 states and 151547 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-16 20:05:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:21,624 INFO L93 Difference]: Finished difference Result 186336 states and 366096 transitions. [2025-03-16 20:05:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:05:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:22,192 INFO L225 Difference]: With dead ends: 186336 [2025-03-16 20:05:22,192 INFO L226 Difference]: Without dead ends: 108466