./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.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_label42+token_ring.09.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 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:49:53,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:49:53,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:49:53,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:49:53,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:49:53,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:49:53,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:49:53,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:49:53,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:49:53,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:49:53,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:49:53,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:49:53,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:49:53,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:49:53,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:49:53,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:49:53,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:49:53,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:49:53,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:53,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:49:53,951 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad [2025-03-08 06:49:54,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:49:54,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:49:54,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:49:54,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:49:54,186 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:49:54,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2025-03-08 06:49:55,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a4ca4d9/329a7c889183471ca883d93468b3ec53/FLAGb70a5df5e [2025-03-08 06:49:55,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:49:55,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2025-03-08 06:49:56,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a4ca4d9/329a7c889183471ca883d93468b3ec53/FLAGb70a5df5e [2025-03-08 06:49:56,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a4ca4d9/329a7c889183471ca883d93468b3ec53 [2025-03-08 06:49:56,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:49:56,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:49:56,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:56,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:49:56,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:49:56,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:56" (1/1) ... [2025-03-08 06:49:56,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:56, skipping insertion in model container [2025-03-08 06:49:56,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:56" (1/1) ... [2025-03-08 06:49:56,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:49:57,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2025-03-08 06:49:57,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2025-03-08 06:49:57,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:57,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:49:58,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2025-03-08 06:49:58,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2025-03-08 06:49:58,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:58,188 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:49:58,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58 WrapperNode [2025-03-08 06:49:58,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:58,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:58,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:49:58,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:49:58,195 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:49:58" (1/1) ... [2025-03-08 06:49:58,254 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:49:58" (1/1) ... [2025-03-08 06:49:58,610 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-03-08 06:49:58,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:58,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:49:58,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:49:58,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:49:58,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,773 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:49:58,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:49:58,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:49:58,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:49:58,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:49:58,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (1/1) ... [2025-03-08 06:49:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:59,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:49:59,017 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:49:59,023 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:49:59,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:49:59,038 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:49:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:49:59,039 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:49:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:49:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:49:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:49:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:49:59,141 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:49:59,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:50:04,942 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:50:04,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:50:04,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:50:04,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:50:04,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:50:04,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:50:04,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:50:05,137 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2025-03-08 06:50:05,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:50:05,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:50:05,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:50:05,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:05 BoogieIcfgContainer [2025-03-08 06:50:05,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:50:05,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:50:05,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:50:05,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:50:05,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:49:56" (1/3) ... [2025-03-08 06:50:05,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4c0453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:05, skipping insertion in model container [2025-03-08 06:50:05,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:58" (2/3) ... [2025-03-08 06:50:05,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4c0453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:05, skipping insertion in model container [2025-03-08 06:50:05,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:05" (3/3) ... [2025-03-08 06:50:05,199 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.09.cil-2.c [2025-03-08 06:50:05,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:50:05,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.09.cil-2.c that has 8 procedures, 2496 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-08 06:50:05,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:50:05,319 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;@17f3fb72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:50:05,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:50:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 06:50:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:05,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:05,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:05,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1624345169, now seen corresponding path program 1 times [2025-03-08 06:50:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309774502] [2025-03-08 06:50:05,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:05,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:05,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:05,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:05,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309774502] [2025-03-08 06:50:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309774502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661482536] [2025-03-08 06:50:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:05,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:05,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:05,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:05,874 INFO L87 Difference]: Start difference. First operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:06,507 INFO L93 Difference]: Finished difference Result 5303 states and 9685 transitions. [2025-03-08 06:50:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:50:06,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:06,538 INFO L225 Difference]: With dead ends: 5303 [2025-03-08 06:50:06,539 INFO L226 Difference]: Without dead ends: 2754 [2025-03-08 06:50:06,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:06,555 INFO L435 NwaCegarLoop]: 4403 mSDtfsCounter, 4933 mSDsluCounter, 9012 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 13415 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:06,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 13415 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:50:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-03-08 06:50:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2729. [2025-03-08 06:50:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2671 states have (on average 1.809434668663422) internal successors, (4833), 2675 states have internal predecessors, (4833), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:50:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4918 transitions. [2025-03-08 06:50:06,690 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4918 transitions. Word has length 144 [2025-03-08 06:50:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4918 transitions. [2025-03-08 06:50:06,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4918 transitions. [2025-03-08 06:50:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:06,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:06,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:50:06,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -564299185, now seen corresponding path program 1 times [2025-03-08 06:50:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324358127] [2025-03-08 06:50:06,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:06,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:06,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:06,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324358127] [2025-03-08 06:50:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324358127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60129176] [2025-03-08 06:50:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:06,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:06,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:06,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:06,902 INFO L87 Difference]: Start difference. First operand 2729 states and 4918 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:07,288 INFO L93 Difference]: Finished difference Result 3380 states and 5967 transitions. [2025-03-08 06:50:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:07,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:07,301 INFO L225 Difference]: With dead ends: 3380 [2025-03-08 06:50:07,301 INFO L226 Difference]: Without dead ends: 2789 [2025-03-08 06:50:07,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:07,305 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4605 mSDsluCounter, 8515 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4622 SdHoareTripleChecker+Valid, 12837 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:07,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4622 Valid, 12837 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:50:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2025-03-08 06:50:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2729. [2025-03-08 06:50:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2671 states have (on average 1.8086858854361663) internal successors, (4831), 2675 states have internal predecessors, (4831), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:50:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4916 transitions. [2025-03-08 06:50:07,386 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4916 transitions. Word has length 144 [2025-03-08 06:50:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:07,387 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4916 transitions. [2025-03-08 06:50:07,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4916 transitions. [2025-03-08 06:50:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:07,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:07,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:07,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:50:07,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:07,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash -133382384, now seen corresponding path program 1 times [2025-03-08 06:50:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62265533] [2025-03-08 06:50:07,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:07,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:07,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:07,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:07,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62265533] [2025-03-08 06:50:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62265533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019130933] [2025-03-08 06:50:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:07,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:07,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:07,640 INFO L87 Difference]: Start difference. First operand 2729 states and 4916 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:08,347 INFO L93 Difference]: Finished difference Result 3700 states and 6469 transitions. [2025-03-08 06:50:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:08,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:08,362 INFO L225 Difference]: With dead ends: 3700 [2025-03-08 06:50:08,362 INFO L226 Difference]: Without dead ends: 3109 [2025-03-08 06:50:08,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:08,368 INFO L435 NwaCegarLoop]: 4585 mSDtfsCounter, 4861 mSDsluCounter, 13782 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4878 SdHoareTripleChecker+Valid, 18367 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:08,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4878 Valid, 18367 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2025-03-08 06:50:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3008. [2025-03-08 06:50:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2925 states have (on average 1.787008547008547) internal successors, (5227), 2930 states have internal predecessors, (5227), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-08 06:50:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 5351 transitions. [2025-03-08 06:50:08,460 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 5351 transitions. Word has length 144 [2025-03-08 06:50:08,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:08,461 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 5351 transitions. [2025-03-08 06:50:08,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 5351 transitions. [2025-03-08 06:50:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:08,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:08,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:08,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:50:08,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:08,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash 988896815, now seen corresponding path program 1 times [2025-03-08 06:50:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021489153] [2025-03-08 06:50:08,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:08,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:08,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021489153] [2025-03-08 06:50:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021489153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031697415] [2025-03-08 06:50:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:08,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:08,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:08,645 INFO L87 Difference]: Start difference. First operand 3008 states and 5351 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:09,344 INFO L93 Difference]: Finished difference Result 4578 states and 7855 transitions. [2025-03-08 06:50:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:09,361 INFO L225 Difference]: With dead ends: 4578 [2025-03-08 06:50:09,361 INFO L226 Difference]: Without dead ends: 3708 [2025-03-08 06:50:09,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:09,367 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 4853 mSDsluCounter, 13760 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 18337 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:09,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 18337 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2025-03-08 06:50:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3598. [2025-03-08 06:50:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 3463 states have (on average 1.7545480796996824) internal successors, (6076), 3472 states have internal predecessors, (6076), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-08 06:50:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 6284 transitions. [2025-03-08 06:50:09,499 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 6284 transitions. Word has length 144 [2025-03-08 06:50:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:09,500 INFO L471 AbstractCegarLoop]: Abstraction has 3598 states and 6284 transitions. [2025-03-08 06:50:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 6284 transitions. [2025-03-08 06:50:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:09,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:09,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:50:09,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1704904434, now seen corresponding path program 1 times [2025-03-08 06:50:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039111333] [2025-03-08 06:50:09,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:09,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:09,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:09,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:09,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039111333] [2025-03-08 06:50:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039111333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27390808] [2025-03-08 06:50:09,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:09,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:09,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:09,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:09,668 INFO L87 Difference]: Start difference. First operand 3598 states and 6284 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:10,305 INFO L93 Difference]: Finished difference Result 6468 states and 10898 transitions. [2025-03-08 06:50:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:10,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:10,325 INFO L225 Difference]: With dead ends: 6468 [2025-03-08 06:50:10,326 INFO L226 Difference]: Without dead ends: 5008 [2025-03-08 06:50:10,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:10,333 INFO L435 NwaCegarLoop]: 4574 mSDtfsCounter, 4848 mSDsluCounter, 13751 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4865 SdHoareTripleChecker+Valid, 18325 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:10,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4865 Valid, 18325 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2025-03-08 06:50:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4871. [2025-03-08 06:50:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4871 states, 4626 states have (on average 1.7163856463467357) internal successors, (7940), 4649 states have internal predecessors, (7940), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 06:50:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 8340 transitions. [2025-03-08 06:50:10,522 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 8340 transitions. Word has length 144 [2025-03-08 06:50:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:10,523 INFO L471 AbstractCegarLoop]: Abstraction has 4871 states and 8340 transitions. [2025-03-08 06:50:10,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 8340 transitions. [2025-03-08 06:50:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:10,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:10,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:10,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:50:10,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:10,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1948976719, now seen corresponding path program 1 times [2025-03-08 06:50:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:10,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354275389] [2025-03-08 06:50:10,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:10,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354275389] [2025-03-08 06:50:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354275389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:10,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415217022] [2025-03-08 06:50:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:10,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:10,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:10,641 INFO L87 Difference]: Start difference. First operand 4871 states and 8340 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:11,267 INFO L93 Difference]: Finished difference Result 10601 states and 17732 transitions. [2025-03-08 06:50:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:11,299 INFO L225 Difference]: With dead ends: 10601 [2025-03-08 06:50:11,299 INFO L226 Difference]: Without dead ends: 7868 [2025-03-08 06:50:11,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:11,311 INFO L435 NwaCegarLoop]: 4571 mSDtfsCounter, 4843 mSDsluCounter, 13742 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4860 SdHoareTripleChecker+Valid, 18313 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:11,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4860 Valid, 18313 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2025-03-08 06:50:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7678. [2025-03-08 06:50:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7678 states, 7195 states have (on average 1.6861709520500348) internal successors, (12132), 7264 states have internal predecessors, (12132), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 13012 transitions. [2025-03-08 06:50:11,515 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 13012 transitions. Word has length 144 [2025-03-08 06:50:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:11,515 INFO L471 AbstractCegarLoop]: Abstraction has 7678 states and 13012 transitions. [2025-03-08 06:50:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 13012 transitions. [2025-03-08 06:50:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:11,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:11,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:50:11,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1119744786, now seen corresponding path program 1 times [2025-03-08 06:50:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:11,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864718615] [2025-03-08 06:50:11,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:11,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:11,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864718615] [2025-03-08 06:50:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864718615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:11,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636325533] [2025-03-08 06:50:11,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:11,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:11,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:11,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:11,626 INFO L87 Difference]: Start difference. First operand 7678 states and 13012 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:11,999 INFO L93 Difference]: Finished difference Result 14380 states and 24404 transitions. [2025-03-08 06:50:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:12,039 INFO L225 Difference]: With dead ends: 14380 [2025-03-08 06:50:12,040 INFO L226 Difference]: Without dead ends: 8840 [2025-03-08 06:50:12,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:12,057 INFO L435 NwaCegarLoop]: 4309 mSDtfsCounter, 4597 mSDsluCounter, 8490 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4614 SdHoareTripleChecker+Valid, 12799 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:12,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4614 Valid, 12799 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8840 states. [2025-03-08 06:50:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8840 to 7678. [2025-03-08 06:50:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7678 states, 7195 states have (on average 1.6838082001389854) internal successors, (12115), 7264 states have internal predecessors, (12115), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 12995 transitions. [2025-03-08 06:50:12,382 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 12995 transitions. Word has length 144 [2025-03-08 06:50:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:12,383 INFO L471 AbstractCegarLoop]: Abstraction has 7678 states and 12995 transitions. [2025-03-08 06:50:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 12995 transitions. [2025-03-08 06:50:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:12,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:12,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:12,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:50:12,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 166737519, now seen corresponding path program 1 times [2025-03-08 06:50:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986040932] [2025-03-08 06:50:12,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:12,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:12,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:12,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986040932] [2025-03-08 06:50:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986040932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488909636] [2025-03-08 06:50:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:12,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:12,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:12,479 INFO L87 Difference]: Start difference. First operand 7678 states and 12995 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:12,856 INFO L93 Difference]: Finished difference Result 14297 states and 24204 transitions. [2025-03-08 06:50:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:12,887 INFO L225 Difference]: With dead ends: 14297 [2025-03-08 06:50:12,887 INFO L226 Difference]: Without dead ends: 8757 [2025-03-08 06:50:12,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:12,903 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4594 mSDsluCounter, 8485 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 12791 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:12,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 12791 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2025-03-08 06:50:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 7678. [2025-03-08 06:50:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7678 states, 7195 states have (on average 1.681445448227936) internal successors, (12098), 7264 states have internal predecessors, (12098), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 12978 transitions. [2025-03-08 06:50:13,117 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 12978 transitions. Word has length 144 [2025-03-08 06:50:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:13,118 INFO L471 AbstractCegarLoop]: Abstraction has 7678 states and 12978 transitions. [2025-03-08 06:50:13,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 12978 transitions. [2025-03-08 06:50:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:13,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:13,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:50:13,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2147067698, now seen corresponding path program 1 times [2025-03-08 06:50:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448078367] [2025-03-08 06:50:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:13,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:13,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448078367] [2025-03-08 06:50:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448078367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424533067] [2025-03-08 06:50:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:13,234 INFO L87 Difference]: Start difference. First operand 7678 states and 12978 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:14,014 INFO L93 Difference]: Finished difference Result 19652 states and 33120 transitions. [2025-03-08 06:50:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:14,057 INFO L225 Difference]: With dead ends: 19652 [2025-03-08 06:50:14,057 INFO L226 Difference]: Without dead ends: 14112 [2025-03-08 06:50:14,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:14,076 INFO L435 NwaCegarLoop]: 4558 mSDtfsCounter, 4822 mSDsluCounter, 13705 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 18263 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4839 Valid, 18263 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14112 states. [2025-03-08 06:50:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14112 to 13859. [2025-03-08 06:50:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13859 states, 12846 states have (on average 1.6669780476412892) internal successors, (21414), 13061 states have internal predecessors, (21414), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-08 06:50:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 23638 transitions. [2025-03-08 06:50:14,453 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 23638 transitions. Word has length 144 [2025-03-08 06:50:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:14,453 INFO L471 AbstractCegarLoop]: Abstraction has 13859 states and 23638 transitions. [2025-03-08 06:50:14,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 23638 transitions. [2025-03-08 06:50:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:14,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:14,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:50:14,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:14,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash 964882063, now seen corresponding path program 1 times [2025-03-08 06:50:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017999114] [2025-03-08 06:50:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:14,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:14,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:14,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:14,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017999114] [2025-03-08 06:50:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017999114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165859853] [2025-03-08 06:50:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:14,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:14,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:14,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:14,631 INFO L87 Difference]: Start difference. First operand 13859 states and 23638 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:15,809 INFO L93 Difference]: Finished difference Result 42229 states and 73179 transitions. [2025-03-08 06:50:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:15,915 INFO L225 Difference]: With dead ends: 42229 [2025-03-08 06:50:15,915 INFO L226 Difference]: Without dead ends: 30508 [2025-03-08 06:50:15,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:15,959 INFO L435 NwaCegarLoop]: 4553 mSDtfsCounter, 5101 mSDsluCounter, 13685 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 18238 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:15,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 18238 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30508 states. [2025-03-08 06:50:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30508 to 27826. [2025-03-08 06:50:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27826 states, 25623 states have (on average 1.6735745228895913) internal successors, (42882), 26292 states have internal predecessors, (42882), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-08 06:50:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27826 states to 27826 states and 49266 transitions. [2025-03-08 06:50:16,945 INFO L78 Accepts]: Start accepts. Automaton has 27826 states and 49266 transitions. Word has length 144 [2025-03-08 06:50:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:16,945 INFO L471 AbstractCegarLoop]: Abstraction has 27826 states and 49266 transitions. [2025-03-08 06:50:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27826 states and 49266 transitions. [2025-03-08 06:50:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:16,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:16,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:16,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:50:16,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -181658450, now seen corresponding path program 1 times [2025-03-08 06:50:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317841935] [2025-03-08 06:50:16,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:16,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:16,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:16,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:16,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317841935] [2025-03-08 06:50:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317841935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354186662] [2025-03-08 06:50:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:17,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:17,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:17,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:17,064 INFO L87 Difference]: Start difference. First operand 27826 states and 49266 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:19,033 INFO L93 Difference]: Finished difference Result 89516 states and 164945 transitions. [2025-03-08 06:50:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:19,324 INFO L225 Difference]: With dead ends: 89516 [2025-03-08 06:50:19,324 INFO L226 Difference]: Without dead ends: 63828 [2025-03-08 06:50:19,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:50:19,413 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5033 mSDsluCounter, 13666 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 18212 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:19,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 18212 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63828 states. [2025-03-08 06:50:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63828 to 59552. [2025-03-08 06:50:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59552 states, 54515 states have (on average 1.688342657984041) internal successors, (92040), 56578 states have internal predecessors, (92040), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59552 states to 59552 states and 112824 transitions. [2025-03-08 06:50:22,320 INFO L78 Accepts]: Start accepts. Automaton has 59552 states and 112824 transitions. Word has length 144 [2025-03-08 06:50:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:22,321 INFO L471 AbstractCegarLoop]: Abstraction has 59552 states and 112824 transitions. [2025-03-08 06:50:22,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 59552 states and 112824 transitions. [2025-03-08 06:50:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:22,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:22,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:22,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:50:22,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash 54019725, now seen corresponding path program 1 times [2025-03-08 06:50:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:22,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870651568] [2025-03-08 06:50:22,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:22,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:22,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:22,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:22,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870651568] [2025-03-08 06:50:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870651568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:22,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:22,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772558857] [2025-03-08 06:50:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:22,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:22,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:22,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:22,671 INFO L87 Difference]: Start difference. First operand 59552 states and 112824 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:26,115 INFO L93 Difference]: Finished difference Result 134478 states and 266762 transitions. [2025-03-08 06:50:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:26,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:26,559 INFO L225 Difference]: With dead ends: 134478 [2025-03-08 06:50:26,559 INFO L226 Difference]: Without dead ends: 77064 [2025-03-08 06:50:26,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:26,791 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4585 mSDsluCounter, 8462 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 12757 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 12757 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77064 states. [2025-03-08 06:50:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77064 to 59552. [2025-03-08 06:50:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59552 states, 54515 states have (on average 1.68597633678804) internal successors, (91911), 56578 states have internal predecessors, (91911), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59552 states to 59552 states and 112695 transitions. [2025-03-08 06:50:30,031 INFO L78 Accepts]: Start accepts. Automaton has 59552 states and 112695 transitions. Word has length 144 [2025-03-08 06:50:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:30,032 INFO L471 AbstractCegarLoop]: Abstraction has 59552 states and 112695 transitions. [2025-03-08 06:50:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 59552 states and 112695 transitions. [2025-03-08 06:50:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:30,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:30,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:50:30,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -769661746, now seen corresponding path program 1 times [2025-03-08 06:50:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711253376] [2025-03-08 06:50:30,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:30,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:30,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:30,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:30,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711253376] [2025-03-08 06:50:30,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711253376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:30,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:30,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393539998] [2025-03-08 06:50:30,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:30,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:30,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:30,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:30,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:30,120 INFO L87 Difference]: Start difference. First operand 59552 states and 112695 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:32,815 INFO L93 Difference]: Finished difference Result 132289 states and 262126 transitions. [2025-03-08 06:50:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 06:50:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:33,176 INFO L225 Difference]: With dead ends: 132289 [2025-03-08 06:50:33,176 INFO L226 Difference]: Without dead ends: 74875 [2025-03-08 06:50:33,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:33,335 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4582 mSDsluCounter, 8457 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4599 SdHoareTripleChecker+Valid, 12749 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:33,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4599 Valid, 12749 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:50:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74875 states. [2025-03-08 06:50:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74875 to 59552. [2025-03-08 06:50:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59552 states, 54515 states have (on average 1.6836100155920388) internal successors, (91782), 56578 states have internal predecessors, (91782), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59552 states to 59552 states and 112566 transitions. [2025-03-08 06:50:36,594 INFO L78 Accepts]: Start accepts. Automaton has 59552 states and 112566 transitions. Word has length 144 [2025-03-08 06:50:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:36,594 INFO L471 AbstractCegarLoop]: Abstraction has 59552 states and 112566 transitions. [2025-03-08 06:50:36,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 59552 states and 112566 transitions. [2025-03-08 06:50:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:50:36,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:36,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:50:36,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 312146541, now seen corresponding path program 1 times [2025-03-08 06:50:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833378989] [2025-03-08 06:50:36,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:50:36,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:50:36,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:36,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833378989] [2025-03-08 06:50:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833378989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753342578] [2025-03-08 06:50:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:36,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:36,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:36,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:36,700 INFO L87 Difference]: Start difference. First operand 59552 states and 112566 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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)