./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.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 ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:51:22,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:51:23,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:51:23,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:51:23,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:51:23,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:51:23,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:51:23,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:51:23,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:51:23,062 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:51:23,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:51:23,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:51:23,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:51:23,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:51:23,063 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:51:23,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:51:23,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:51:23,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:51:23,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:51:23,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:51:23,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:23,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:51:23,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:51:23,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:51:23,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:51:23,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:51:23,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:51:23,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:51:23,066 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 -> ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 [2025-03-08 06:51:23,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:51:23,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:51:23,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:51:23,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:51:23,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:51:23,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2025-03-08 06:51:24,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef615e72/12f1f3c7a41f4a56b4241060a21bdddc/FLAG1882558d9 [2025-03-08 06:51:24,991 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:51:24,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2025-03-08 06:51:25,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef615e72/12f1f3c7a41f4a56b4241060a21bdddc/FLAG1882558d9 [2025-03-08 06:51:25,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef615e72/12f1f3c7a41f4a56b4241060a21bdddc [2025-03-08 06:51:25,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:51:25,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:51:25,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:25,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:51:25,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:51:25,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:25" (1/1) ... [2025-03-08 06:51:25,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3ce5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:25, skipping insertion in model container [2025-03-08 06:51:25,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:25" (1/1) ... [2025-03-08 06:51:25,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:51:26,970 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_label43+token_ring.07.cil-2.c[381679,381692] [2025-03-08 06:51:27,006 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_label43+token_ring.07.cil-2.c[383339,383352] [2025-03-08 06:51:27,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:27,230 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:51:27,751 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_label43+token_ring.07.cil-2.c[381679,381692] [2025-03-08 06:51:27,755 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_label43+token_ring.07.cil-2.c[383339,383352] [2025-03-08 06:51:27,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:27,823 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:51:27,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27 WrapperNode [2025-03-08 06:51:27,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:27,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:27,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:51:27,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:51:27,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:27,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,221 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12906 [2025-03-08 06:51:28,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:28,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:51:28,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:51:28,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:51:28,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:51:28,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:51:28,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:51:28,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:51:28,791 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:51:28,792 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (1/1) ... [2025-03-08 06:51:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:51:28,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:51:28,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:51:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:51:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:51:28,845 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:51:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:51:28,845 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:51:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:51:28,845 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:51:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:51:28,845 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:51:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:51:28,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:51:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:51:28,846 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:51:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:51:28,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:51:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:51:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:51:28,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:51:28,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:51:28,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:51:35,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:51:35,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:51:35,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:51:35,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:51:35,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:51:35,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:51:35,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:51:35,766 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-03-08 06:51:35,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:51:35,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:51:35,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:51:35,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:35 BoogieIcfgContainer [2025-03-08 06:51:35,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:51:35,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:51:35,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:51:35,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:51:35,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:51:25" (1/3) ... [2025-03-08 06:51:35,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a69ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:35, skipping insertion in model container [2025-03-08 06:51:35,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:27" (2/3) ... [2025-03-08 06:51:35,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a69ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:35, skipping insertion in model container [2025-03-08 06:51:35,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:35" (3/3) ... [2025-03-08 06:51:35,848 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-2.c [2025-03-08 06:51:35,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:51:35,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.07.cil-2.c that has 8 procedures, 2446 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 06:51:35,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:51:35,992 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;@3c63cf84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:51:35,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:51:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 2446 states, 2414 states have (on average 1.8454846727423364) internal successors, (4455), 2418 states have internal predecessors, (4455), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 06:51:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:36,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:36,019 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] [2025-03-08 06:51:36,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:36,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:36,025 INFO L85 PathProgramCache]: Analyzing trace with hash -430823002, now seen corresponding path program 1 times [2025-03-08 06:51:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:36,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487908418] [2025-03-08 06:51:36,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:36,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:36,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487908418] [2025-03-08 06:51:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487908418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:36,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:36,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373859513] [2025-03-08 06:51:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:36,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:36,577 INFO L87 Difference]: Start difference. First operand has 2446 states, 2414 states have (on average 1.8454846727423364) internal successors, (4455), 2418 states have internal predecessors, (4455), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:37,120 INFO L93 Difference]: Finished difference Result 4890 states and 9007 transitions. [2025-03-08 06:51:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:37,141 INFO L225 Difference]: With dead ends: 4890 [2025-03-08 06:51:37,142 INFO L226 Difference]: Without dead ends: 2394 [2025-03-08 06:51:37,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:37,151 INFO L435 NwaCegarLoop]: 4325 mSDtfsCounter, 4554 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12866 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:37,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12866 Invalid, 338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:51:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2025-03-08 06:51:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2378. [2025-03-08 06:51:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2347 states have (on average 1.8376651043885812) internal successors, (4313), 2350 states have internal predecessors, (4313), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:51:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 4357 transitions. [2025-03-08 06:51:37,290 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 4357 transitions. Word has length 122 [2025-03-08 06:51:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:37,291 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 4357 transitions. [2025-03-08 06:51:37,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 4357 transitions. [2025-03-08 06:51:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:37,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:37,298 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] [2025-03-08 06:51:37,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:51:37,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:37,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 699963623, now seen corresponding path program 1 times [2025-03-08 06:51:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717154981] [2025-03-08 06:51:37,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:37,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:37,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717154981] [2025-03-08 06:51:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717154981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317309593] [2025-03-08 06:51:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:37,497 INFO L87 Difference]: Start difference. First operand 2378 states and 4357 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:38,156 INFO L93 Difference]: Finished difference Result 2906 states and 5197 transitions. [2025-03-08 06:51:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:38,168 INFO L225 Difference]: With dead ends: 2906 [2025-03-08 06:51:38,168 INFO L226 Difference]: Without dead ends: 2664 [2025-03-08 06:51:38,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:38,171 INFO L435 NwaCegarLoop]: 4479 mSDtfsCounter, 4687 mSDsluCounter, 13529 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4702 SdHoareTripleChecker+Valid, 18008 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:38,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4702 Valid, 18008 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-08 06:51:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2630. [2025-03-08 06:51:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2573 states have (on average 1.815390594636611) internal successors, (4671), 2578 states have internal predecessors, (4671), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-08 06:51:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 4758 transitions. [2025-03-08 06:51:38,239 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 4758 transitions. Word has length 122 [2025-03-08 06:51:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:38,239 INFO L471 AbstractCegarLoop]: Abstraction has 2630 states and 4758 transitions. [2025-03-08 06:51:38,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 4758 transitions. [2025-03-08 06:51:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:38,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:38,243 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] [2025-03-08 06:51:38,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:51:38,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -233390714, now seen corresponding path program 1 times [2025-03-08 06:51:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:38,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510542107] [2025-03-08 06:51:38,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:38,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:38,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:38,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:38,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:38,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:38,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510542107] [2025-03-08 06:51:38,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510542107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:38,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:38,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162900669] [2025-03-08 06:51:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:38,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:38,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:38,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:38,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:38,490 INFO L87 Difference]: Start difference. First operand 2630 states and 4758 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:39,107 INFO L93 Difference]: Finished difference Result 3658 states and 6395 transitions. [2025-03-08 06:51:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:39,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:39,120 INFO L225 Difference]: With dead ends: 3658 [2025-03-08 06:51:39,120 INFO L226 Difference]: Without dead ends: 3166 [2025-03-08 06:51:39,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:39,124 INFO L435 NwaCegarLoop]: 4440 mSDtfsCounter, 4683 mSDsluCounter, 13447 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 17887 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:39,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 17887 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2025-03-08 06:51:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3120. [2025-03-08 06:51:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3015 states have (on average 1.7804311774461028) internal successors, (5368), 3024 states have internal predecessors, (5368), 73 states have call successors, (73), 25 states have call predecessors, (73), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-08 06:51:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 5535 transitions. [2025-03-08 06:51:39,227 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 5535 transitions. Word has length 122 [2025-03-08 06:51:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:39,228 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 5535 transitions. [2025-03-08 06:51:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 5535 transitions. [2025-03-08 06:51:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:39,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:39,232 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] [2025-03-08 06:51:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:51:39,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1260521735, now seen corresponding path program 1 times [2025-03-08 06:51:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159848449] [2025-03-08 06:51:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:39,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:39,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:39,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:39,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159848449] [2025-03-08 06:51:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159848449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:39,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479941515] [2025-03-08 06:51:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:39,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:39,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:39,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:39,382 INFO L87 Difference]: Start difference. First operand 3120 states and 5535 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:40,031 INFO L93 Difference]: Finished difference Result 5225 states and 8926 transitions. [2025-03-08 06:51:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:40,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:40,059 INFO L225 Difference]: With dead ends: 5225 [2025-03-08 06:51:40,060 INFO L226 Difference]: Without dead ends: 4243 [2025-03-08 06:51:40,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:40,067 INFO L435 NwaCegarLoop]: 4439 mSDtfsCounter, 4678 mSDsluCounter, 13436 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 17875 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:40,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 17875 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2025-03-08 06:51:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 4174. [2025-03-08 06:51:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 3967 states have (on average 1.7368288379127805) internal successors, (6890), 3990 states have internal predecessors, (6890), 137 states have call successors, (137), 49 states have call predecessors, (137), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-08 06:51:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 7241 transitions. [2025-03-08 06:51:40,227 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 7241 transitions. Word has length 122 [2025-03-08 06:51:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 4174 states and 7241 transitions. [2025-03-08 06:51:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 7241 transitions. [2025-03-08 06:51:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:40,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:40,231 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] [2025-03-08 06:51:40,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:51:40,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:40,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash 61786470, now seen corresponding path program 1 times [2025-03-08 06:51:40,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:40,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856534952] [2025-03-08 06:51:40,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856534952] [2025-03-08 06:51:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856534952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:40,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:40,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751260606] [2025-03-08 06:51:40,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:40,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:40,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:40,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:40,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:40,384 INFO L87 Difference]: Start difference. First operand 4174 states and 7241 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:40,999 INFO L93 Difference]: Finished difference Result 8636 states and 14584 transitions. [2025-03-08 06:51:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:41,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:41,027 INFO L225 Difference]: With dead ends: 8636 [2025-03-08 06:51:41,028 INFO L226 Difference]: Without dead ends: 6600 [2025-03-08 06:51:41,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:41,037 INFO L435 NwaCegarLoop]: 4439 mSDtfsCounter, 4673 mSDsluCounter, 13429 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 17868 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:41,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 17868 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6600 states. [2025-03-08 06:51:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6600 to 6488. [2025-03-08 06:51:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 6059 states have (on average 1.6979699620399407) internal successors, (10288), 6128 states have internal predecessors, (10288), 265 states have call successors, (265), 97 states have call predecessors, (265), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-08 06:51:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 11103 transitions. [2025-03-08 06:51:41,327 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 11103 transitions. Word has length 122 [2025-03-08 06:51:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:41,328 INFO L471 AbstractCegarLoop]: Abstraction has 6488 states and 11103 transitions. [2025-03-08 06:51:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 11103 transitions. [2025-03-08 06:51:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:41,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:41,332 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] [2025-03-08 06:51:41,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:51:41,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:41,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 577306919, now seen corresponding path program 1 times [2025-03-08 06:51:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878842678] [2025-03-08 06:51:41,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:41,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:41,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878842678] [2025-03-08 06:51:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878842678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:41,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:41,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149149731] [2025-03-08 06:51:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:41,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:41,445 INFO L87 Difference]: Start difference. First operand 6488 states and 11103 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:42,091 INFO L93 Difference]: Finished difference Result 16223 states and 27682 transitions. [2025-03-08 06:51:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:42,156 INFO L225 Difference]: With dead ends: 16223 [2025-03-08 06:51:42,156 INFO L226 Difference]: Without dead ends: 11873 [2025-03-08 06:51:42,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:42,178 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4668 mSDsluCounter, 13412 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4683 SdHoareTripleChecker+Valid, 17847 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:42,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4683 Valid, 17847 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2025-03-08 06:51:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 11682. [2025-03-08 06:51:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11682 states, 10755 states have (on average 1.6779172477917248) internal successors, (18046), 10970 states have internal predecessors, (18046), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11682 states to 11682 states and 20173 transitions. [2025-03-08 06:51:42,595 INFO L78 Accepts]: Start accepts. Automaton has 11682 states and 20173 transitions. Word has length 122 [2025-03-08 06:51:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:42,597 INFO L471 AbstractCegarLoop]: Abstraction has 11682 states and 20173 transitions. [2025-03-08 06:51:42,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11682 states and 20173 transitions. [2025-03-08 06:51:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:42,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:42,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:51:42,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash -375894714, now seen corresponding path program 1 times [2025-03-08 06:51:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071925482] [2025-03-08 06:51:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:42,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:42,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:42,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:42,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071925482] [2025-03-08 06:51:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071925482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695392106] [2025-03-08 06:51:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:42,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:42,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:42,773 INFO L87 Difference]: Start difference. First operand 11682 states and 20173 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:43,254 INFO L93 Difference]: Finished difference Result 23658 states and 41647 transitions. [2025-03-08 06:51:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:43,319 INFO L225 Difference]: With dead ends: 23658 [2025-03-08 06:51:43,320 INFO L226 Difference]: Without dead ends: 14112 [2025-03-08 06:51:43,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:43,357 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4479 mSDsluCounter, 8382 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 12627 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:43,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 12627 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14112 states. [2025-03-08 06:51:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14112 to 11682. [2025-03-08 06:51:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11682 states, 10755 states have (on average 1.6748489074848907) internal successors, (18013), 10970 states have internal predecessors, (18013), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11682 states to 11682 states and 20140 transitions. [2025-03-08 06:51:43,885 INFO L78 Accepts]: Start accepts. Automaton has 11682 states and 20140 transitions. Word has length 122 [2025-03-08 06:51:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:43,885 INFO L471 AbstractCegarLoop]: Abstraction has 11682 states and 20140 transitions. [2025-03-08 06:51:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11682 states and 20140 transitions. [2025-03-08 06:51:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:43,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:43,893 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] [2025-03-08 06:51:43,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:51:43,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash 424640839, now seen corresponding path program 1 times [2025-03-08 06:51:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498996756] [2025-03-08 06:51:43,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:43,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:43,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498996756] [2025-03-08 06:51:43,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498996756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:43,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:43,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509641688] [2025-03-08 06:51:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:43,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:43,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:43,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:43,985 INFO L87 Difference]: Start difference. First operand 11682 states and 20140 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:44,438 INFO L93 Difference]: Finished difference Result 23172 states and 40609 transitions. [2025-03-08 06:51:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:44,493 INFO L225 Difference]: With dead ends: 23172 [2025-03-08 06:51:44,493 INFO L226 Difference]: Without dead ends: 13626 [2025-03-08 06:51:44,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:44,527 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4473 mSDsluCounter, 8371 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 12611 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:44,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 12611 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13626 states. [2025-03-08 06:51:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13626 to 11682. [2025-03-08 06:51:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11682 states, 10755 states have (on average 1.6717805671780568) internal successors, (17980), 10970 states have internal predecessors, (17980), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11682 states to 11682 states and 20107 transitions. [2025-03-08 06:51:45,210 INFO L78 Accepts]: Start accepts. Automaton has 11682 states and 20107 transitions. Word has length 122 [2025-03-08 06:51:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 11682 states and 20107 transitions. [2025-03-08 06:51:45,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11682 states and 20107 transitions. [2025-03-08 06:51:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:45,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:45,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:45,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:51:45,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:45,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1100333448, now seen corresponding path program 1 times [2025-03-08 06:51:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815385879] [2025-03-08 06:51:45,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:45,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:45,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:45,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:45,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815385879] [2025-03-08 06:51:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815385879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:45,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:45,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42210198] [2025-03-08 06:51:45,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:45,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:45,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:45,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:45,350 INFO L87 Difference]: Start difference. First operand 11682 states and 20107 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:46,382 INFO L93 Difference]: Finished difference Result 33941 states and 59443 transitions. [2025-03-08 06:51:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:46,555 INFO L225 Difference]: With dead ends: 33941 [2025-03-08 06:51:46,555 INFO L226 Difference]: Without dead ends: 24397 [2025-03-08 06:51:46,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:46,575 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4809 mSDsluCounter, 13340 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4832 SdHoareTripleChecker+Valid, 17759 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:46,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4832 Valid, 17759 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24397 states. [2025-03-08 06:51:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24397 to 22786. [2025-03-08 06:51:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22786 states, 20733 states have (on average 1.6635315680316405) internal successors, (34490), 21402 states have internal predecessors, (34490), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 40713 transitions. [2025-03-08 06:51:47,412 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 40713 transitions. Word has length 122 [2025-03-08 06:51:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:47,415 INFO L471 AbstractCegarLoop]: Abstraction has 22786 states and 40713 transitions. [2025-03-08 06:51:47,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 40713 transitions. [2025-03-08 06:51:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:47,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:47,427 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] [2025-03-08 06:51:47,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:51:47,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 290845991, now seen corresponding path program 1 times [2025-03-08 06:51:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515162528] [2025-03-08 06:51:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515162528] [2025-03-08 06:51:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515162528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:47,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385915485] [2025-03-08 06:51:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:47,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:47,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:47,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:47,584 INFO L87 Difference]: Start difference. First operand 22786 states and 40713 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:48,462 INFO L93 Difference]: Finished difference Result 47810 states and 88357 transitions. [2025-03-08 06:51:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:48,591 INFO L225 Difference]: With dead ends: 47810 [2025-03-08 06:51:48,591 INFO L226 Difference]: Without dead ends: 27160 [2025-03-08 06:51:48,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:48,810 INFO L435 NwaCegarLoop]: 4235 mSDtfsCounter, 4469 mSDsluCounter, 8362 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 12597 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:48,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4484 Valid, 12597 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27160 states. [2025-03-08 06:51:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27160 to 22786. [2025-03-08 06:51:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22786 states, 20733 states have (on average 1.660396469396614) internal successors, (34425), 21402 states have internal predecessors, (34425), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 40648 transitions. [2025-03-08 06:51:49,908 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 40648 transitions. Word has length 122 [2025-03-08 06:51:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:49,908 INFO L471 AbstractCegarLoop]: Abstraction has 22786 states and 40648 transitions. [2025-03-08 06:51:49,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 40648 transitions. [2025-03-08 06:51:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:49,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:49,922 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] [2025-03-08 06:51:49,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:51:49,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -150908504, now seen corresponding path program 1 times [2025-03-08 06:51:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034785403] [2025-03-08 06:51:49,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:49,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:49,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:49,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:49,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:49,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034785403] [2025-03-08 06:51:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034785403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:50,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377500129] [2025-03-08 06:51:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:50,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:50,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:50,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:50,024 INFO L87 Difference]: Start difference. First operand 22786 states and 40648 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:51,527 INFO L93 Difference]: Finished difference Result 47081 states and 86769 transitions. [2025-03-08 06:51:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:51,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:51,629 INFO L225 Difference]: With dead ends: 47081 [2025-03-08 06:51:51,629 INFO L226 Difference]: Without dead ends: 26431 [2025-03-08 06:51:51,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:51,669 INFO L435 NwaCegarLoop]: 4232 mSDtfsCounter, 4466 mSDsluCounter, 8357 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 12589 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 12589 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26431 states. [2025-03-08 06:51:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26431 to 22786. [2025-03-08 06:51:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22786 states, 20733 states have (on average 1.6572613707615877) internal successors, (34360), 21402 states have internal predecessors, (34360), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 40583 transitions. [2025-03-08 06:51:53,114 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 40583 transitions. Word has length 122 [2025-03-08 06:51:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:53,114 INFO L471 AbstractCegarLoop]: Abstraction has 22786 states and 40583 transitions. [2025-03-08 06:51:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 40583 transitions. [2025-03-08 06:51:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:53,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:53,124 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] [2025-03-08 06:51:53,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:51:53,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:53,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -165158649, now seen corresponding path program 1 times [2025-03-08 06:51:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:53,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232322814] [2025-03-08 06:51:53,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:53,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:53,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:53,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232322814] [2025-03-08 06:51:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232322814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:53,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371038360] [2025-03-08 06:51:53,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:53,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:53,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:53,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:53,218 INFO L87 Difference]: Start difference. First operand 22786 states and 40583 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:55,603 INFO L93 Difference]: Finished difference Result 68428 states and 128069 transitions. [2025-03-08 06:51:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:55,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:51:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:55,827 INFO L225 Difference]: With dead ends: 68428 [2025-03-08 06:51:55,827 INFO L226 Difference]: Without dead ends: 47780 [2025-03-08 06:51:55,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:51:55,908 INFO L435 NwaCegarLoop]: 4407 mSDtfsCounter, 4698 mSDsluCounter, 13290 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4721 SdHoareTripleChecker+Valid, 17697 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:55,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4721 Valid, 17697 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47780 states. [2025-03-08 06:51:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47780 to 46108. [2025-03-08 06:51:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46108 states, 41349 states have (on average 1.6473917144308206) internal successors, (68118), 43412 states have internal predecessors, (68118), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:51:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46108 states to 46108 states and 88613 transitions. [2025-03-08 06:51:58,623 INFO L78 Accepts]: Start accepts. Automaton has 46108 states and 88613 transitions. Word has length 122 [2025-03-08 06:51:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:58,625 INFO L471 AbstractCegarLoop]: Abstraction has 46108 states and 88613 transitions. [2025-03-08 06:51:58,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:51:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 46108 states and 88613 transitions. [2025-03-08 06:51:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:51:58,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:58,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:58,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:51:58,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1135449656, now seen corresponding path program 1 times [2025-03-08 06:51:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078883864] [2025-03-08 06:51:58,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:51:58,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:51:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:58,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078883864] [2025-03-08 06:51:58,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078883864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:58,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362359162] [2025-03-08 06:51:58,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:58,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:58,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:58,715 INFO L87 Difference]: Start difference. First operand 46108 states and 88613 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:00,939 INFO L93 Difference]: Finished difference Result 96641 states and 196701 transitions. [2025-03-08 06:52:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:52:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:01,195 INFO L225 Difference]: With dead ends: 96641 [2025-03-08 06:52:01,195 INFO L226 Difference]: Without dead ends: 52669 [2025-03-08 06:52:01,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:01,296 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 4462 mSDsluCounter, 8348 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 12575 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:01,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 12575 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52669 states. [2025-03-08 06:52:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52669 to 46108. [2025-03-08 06:52:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46108 states, 41349 states have (on average 1.6442719291881303) internal successors, (67989), 43412 states have internal predecessors, (67989), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:52:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46108 states to 46108 states and 88484 transitions. [2025-03-08 06:52:05,841 INFO L78 Accepts]: Start accepts. Automaton has 46108 states and 88484 transitions. Word has length 122 [2025-03-08 06:52:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 46108 states and 88484 transitions. [2025-03-08 06:52:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46108 states and 88484 transitions. [2025-03-08 06:52:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:52:05,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:05,859 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] [2025-03-08 06:52:05,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:52:05,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -196918041, now seen corresponding path program 1 times [2025-03-08 06:52:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37444737] [2025-03-08 06:52:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:05,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:52:06,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:52:06,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:06,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37444737] [2025-03-08 06:52:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37444737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470466635] [2025-03-08 06:52:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:06,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:06,187 INFO L87 Difference]: Start difference. First operand 46108 states and 88484 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:10,930 INFO L93 Difference]: Finished difference Result 139270 states and 294271 transitions. [2025-03-08 06:52:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-08 06:52:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:11,393 INFO L225 Difference]: With dead ends: 139270 [2025-03-08 06:52:11,394 INFO L226 Difference]: Without dead ends: 95300 [2025-03-08 06:52:11,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:11,511 INFO L435 NwaCegarLoop]: 4402 mSDtfsCounter, 4625 mSDsluCounter, 13264 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4648 SdHoareTripleChecker+Valid, 17666 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:11,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4648 Valid, 17666 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:52:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95300 states. [2025-03-08 06:52:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95300 to 94014. [2025-03-08 06:52:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94014 states, 82449 states have (on average 1.6218389549903576) internal successors, (133719), 88758 states have internal predecessors, (133719), 3721 states have call successors, (3721), 1537 states have call predecessors, (3721), 7842 states have return successors, (69766), 3974 states have call predecessors, (69766), 3719 states have call successors, (69766) [2025-03-08 06:52:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94014 states to 94014 states and 207206 transitions. [2025-03-08 06:52:19,204 INFO L78 Accepts]: Start accepts. Automaton has 94014 states and 207206 transitions. Word has length 122 [2025-03-08 06:52:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 94014 states and 207206 transitions. [2025-03-08 06:52:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 94014 states and 207206 transitions. [2025-03-08 06:52:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:52:19,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:19,497 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] [2025-03-08 06:52:19,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:52:19,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash -582284824, now seen corresponding path program 1 times [2025-03-08 06:52:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33346079] [2025-03-08 06:52:19,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:19,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:52:19,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:52:19,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:19,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33346079] [2025-03-08 06:52:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33346079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:52:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324568705] [2025-03-08 06:52:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:19,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:52:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:19,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:52:19,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:52:19,691 INFO L87 Difference]: Start difference. First operand 94014 states and 207206 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:28,693 INFO L93 Difference]: Finished difference Result 275456 states and 613129 transitions. [2025-03-08 06:52:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 2 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 122 [2025-03-08 06:52:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:30,259 INFO L225 Difference]: With dead ends: 275456 [2025-03-08 06:52:30,260 INFO L226 Difference]: Without dead ends: 183580 [2025-03-08 06:52:30,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:52:30,522 INFO L435 NwaCegarLoop]: 4687 mSDtfsCounter, 4626 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4626 SdHoareTripleChecker+Valid, 9293 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:30,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4626 Valid, 9293 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:52:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183580 states.