./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.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 4193af75abf6aff12bf0c3b1d52895798f02d5d81afc60ee7b84e09fa25d7f81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:04:15,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:04:15,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:04:15,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:04:15,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:04:15,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:04:15,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:04:15,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:04:15,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:04:15,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:04:15,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:04:15,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:04:15,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:04:15,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:04:15,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:15,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:04:15,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:04:15,830 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 -> 4193af75abf6aff12bf0c3b1d52895798f02d5d81afc60ee7b84e09fa25d7f81 [2025-03-16 20:04:16,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:04:16,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:04:16,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:04:16,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:04:16,057 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:04:16,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c [2025-03-16 20:04:17,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae358e75/40d1ba452c8046cba1e29ffba6a2418a/FLAG3c62af1b4 [2025-03-16 20:04:17,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:04:17,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c [2025-03-16 20:04:17,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae358e75/40d1ba452c8046cba1e29ffba6a2418a/FLAG3c62af1b4 [2025-03-16 20:04:17,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae358e75/40d1ba452c8046cba1e29ffba6a2418a [2025-03-16 20:04:17,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:04:17,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:04:17,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:17,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:04:17,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:04:17,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:17" (1/1) ... [2025-03-16 20:04:17,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a60cd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:17, skipping insertion in model container [2025-03-16 20:04:17,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:17" (1/1) ... [2025-03-16 20:04:17,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:04:18,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[382357,382370] [2025-03-16 20:04:18,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[383339,383352] [2025-03-16 20:04:19,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:19,228 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:04:19,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[382357,382370] [2025-03-16 20:04:19,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[383339,383352] [2025-03-16 20:04:19,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:19,859 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:04:19,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19 WrapperNode [2025-03-16 20:04:19,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:19,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:19,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:04:19,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:04:19,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:19,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,244 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-03-16 20:04:20,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:20,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:04:20,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:04:20,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:04:20,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,421 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:04:20,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:04:20,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:04:20,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:04:20,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:04:20,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (1/1) ... [2025-03-16 20:04:20,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:20,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:04:20,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:04:20,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:04:20,833 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:04:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:04:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:04:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:04:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:04:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:04:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:04:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:04:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:04:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:04:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:04:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:04:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:04:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:04:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:04:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:04:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:04:20,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:04:20,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:04:27,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:04:27,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:04:27,295 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-03-16 20:04:27,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:04:27,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:04:27,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:04:27,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:27 BoogieIcfgContainer [2025-03-16 20:04:27,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:04:27,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:04:27,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:04:27,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:04:27,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:04:17" (1/3) ... [2025-03-16 20:04:27,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d96fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:27, skipping insertion in model container [2025-03-16 20:04:27,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:19" (2/3) ... [2025-03-16 20:04:27,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d96fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:27, skipping insertion in model container [2025-03-16 20:04:27,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:27" (3/3) ... [2025-03-16 20:04:27,358 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.09.cil-2.c [2025-03-16 20:04:27,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:04:27,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.09.cil-2.c that has 8 procedures, 2421 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-16 20:04:27,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:04:27,471 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;@3587c37d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:04:27,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:04:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 2421 states, 2387 states have (on average 1.8684541265186427) internal successors, (4460), 2391 states have internal predecessors, (4460), 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-16 20:04:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:27,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:27,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:27,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2045722081, now seen corresponding path program 1 times [2025-03-16 20:04:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:27,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053845004] [2025-03-16 20:04:27,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:27,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:27,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:27,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053845004] [2025-03-16 20:04:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053845004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66765425] [2025-03-16 20:04:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:28,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:28,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:28,037 INFO L87 Difference]: Start difference. First operand has 2421 states, 2387 states have (on average 1.8684541265186427) internal successors, (4460), 2391 states have internal predecessors, (4460), 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 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:28,972 INFO L93 Difference]: Finished difference Result 5143 states and 9525 transitions. [2025-03-16 20:04:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:04:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:29,003 INFO L225 Difference]: With dead ends: 5143 [2025-03-16 20:04:29,004 INFO L226 Difference]: Without dead ends: 2729 [2025-03-16 20:04:29,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:29,018 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4841 mSDsluCounter, 8875 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4858 SdHoareTripleChecker+Valid, 13211 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:29,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4858 Valid, 13211 Invalid, 538 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:04:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-16 20:04:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2704. [2025-03-16 20:04:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2646 states have (on average 1.81708238851096) internal successors, (4808), 2650 states have internal predecessors, (4808), 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-16 20:04:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4893 transitions. [2025-03-16 20:04:29,160 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 4893 transitions. Word has length 132 [2025-03-16 20:04:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:29,160 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 4893 transitions. [2025-03-16 20:04:29,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 4893 transitions. [2025-03-16 20:04:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:29,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:29,165 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] [2025-03-16 20:04:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:04:29,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:29,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1762981729, now seen corresponding path program 1 times [2025-03-16 20:04:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160185907] [2025-03-16 20:04:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:29,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:29,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:29,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:29,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160185907] [2025-03-16 20:04:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160185907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:29,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:29,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436739503] [2025-03-16 20:04:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:29,390 INFO L87 Difference]: Start difference. First operand 2704 states and 4893 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:29,995 INFO L93 Difference]: Finished difference Result 3641 states and 6416 transitions. [2025-03-16 20:04:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:30,008 INFO L225 Difference]: With dead ends: 3641 [2025-03-16 20:04:30,009 INFO L226 Difference]: Without dead ends: 3073 [2025-03-16 20:04:30,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:30,013 INFO L435 NwaCegarLoop]: 4581 mSDtfsCounter, 4835 mSDsluCounter, 13769 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4852 SdHoareTripleChecker+Valid, 18350 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:30,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4852 Valid, 18350 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2025-03-16 20:04:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2972. [2025-03-16 20:04:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2889 states have (on average 1.7978539286950501) internal successors, (5194), 2894 states have internal predecessors, (5194), 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-16 20:04:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5318 transitions. [2025-03-16 20:04:30,097 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5318 transitions. Word has length 132 [2025-03-16 20:04:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 5318 transitions. [2025-03-16 20:04:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5318 transitions. [2025-03-16 20:04:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:30,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:30,099 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] [2025-03-16 20:04:30,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:04:30,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1527303554, now seen corresponding path program 1 times [2025-03-16 20:04:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827653690] [2025-03-16 20:04:30,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:30,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:30,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:30,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:30,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827653690] [2025-03-16 20:04:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827653690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116352436] [2025-03-16 20:04:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:30,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:30,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:30,253 INFO L87 Difference]: Start difference. First operand 2972 states and 5318 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:30,862 INFO L93 Difference]: Finished difference Result 4494 states and 7788 transitions. [2025-03-16 20:04:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:30,876 INFO L225 Difference]: With dead ends: 4494 [2025-03-16 20:04:30,877 INFO L226 Difference]: Without dead ends: 3658 [2025-03-16 20:04:30,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:30,881 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 4830 mSDsluCounter, 13757 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4847 SdHoareTripleChecker+Valid, 18334 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:30,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4847 Valid, 18334 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2025-03-16 20:04:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3543. [2025-03-16 20:04:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3408 states have (on average 1.7690727699530517) internal successors, (6029), 3417 states have internal predecessors, (6029), 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-16 20:04:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 6237 transitions. [2025-03-16 20:04:31,018 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 6237 transitions. Word has length 132 [2025-03-16 20:04:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 6237 transitions. [2025-03-16 20:04:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 6237 transitions. [2025-03-16 20:04:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:31,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:31,021 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] [2025-03-16 20:04:31,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:04:31,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1943982271, now seen corresponding path program 1 times [2025-03-16 20:04:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969445440] [2025-03-16 20:04:31,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:31,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:31,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:31,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969445440] [2025-03-16 20:04:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969445440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:31,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:31,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743508380] [2025-03-16 20:04:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:31,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:31,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:31,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:31,149 INFO L87 Difference]: Start difference. First operand 3543 states and 6237 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:31,753 INFO L93 Difference]: Finished difference Result 6335 states and 10805 transitions. [2025-03-16 20:04:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:31,778 INFO L225 Difference]: With dead ends: 6335 [2025-03-16 20:04:31,778 INFO L226 Difference]: Without dead ends: 4928 [2025-03-16 20:04:31,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:31,786 INFO L435 NwaCegarLoop]: 4574 mSDtfsCounter, 4825 mSDsluCounter, 13748 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 18322 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 18322 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-16 20:04:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4784. [2025-03-16 20:04:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4539 states have (on average 1.7354042740691782) internal successors, (7877), 4562 states have internal predecessors, (7877), 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-16 20:04:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 8277 transitions. [2025-03-16 20:04:31,931 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 8277 transitions. Word has length 132 [2025-03-16 20:04:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 8277 transitions. [2025-03-16 20:04:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 8277 transitions. [2025-03-16 20:04:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:31,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:31,933 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] [2025-03-16 20:04:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:04:31,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1269176738, now seen corresponding path program 1 times [2025-03-16 20:04:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670387684] [2025-03-16 20:04:31,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:31,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:31,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:31,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670387684] [2025-03-16 20:04:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670387684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130175651] [2025-03-16 20:04:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:32,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:32,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:32,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:32,047 INFO L87 Difference]: Start difference. First operand 4784 states and 8277 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:32,773 INFO L93 Difference]: Finished difference Result 10394 states and 17635 transitions. [2025-03-16 20:04:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:32,806 INFO L225 Difference]: With dead ends: 10394 [2025-03-16 20:04:32,807 INFO L226 Difference]: Without dead ends: 7746 [2025-03-16 20:04:32,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:32,816 INFO L435 NwaCegarLoop]: 4571 mSDtfsCounter, 4820 mSDsluCounter, 13739 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 18310 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:32,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 18310 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2025-03-16 20:04:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7545. [2025-03-16 20:04:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7545 states, 7062 states have (on average 1.7095723591050693) internal successors, (12073), 7131 states have internal predecessors, (12073), 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-16 20:04:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 12953 transitions. [2025-03-16 20:04:33,041 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 12953 transitions. Word has length 132 [2025-03-16 20:04:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:33,042 INFO L471 AbstractCegarLoop]: Abstraction has 7545 states and 12953 transitions. [2025-03-16 20:04:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 12953 transitions. [2025-03-16 20:04:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:33,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:33,046 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] [2025-03-16 20:04:33,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:04:33,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1788469025, now seen corresponding path program 1 times [2025-03-16 20:04:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576865675] [2025-03-16 20:04:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:33,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:33,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:33,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:33,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576865675] [2025-03-16 20:04:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576865675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:33,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398545588] [2025-03-16 20:04:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:33,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:33,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:33,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:33,175 INFO L87 Difference]: Start difference. First operand 7545 states and 12953 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:34,112 INFO L93 Difference]: Finished difference Result 19569 states and 33661 transitions. [2025-03-16 20:04:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:34,210 INFO L225 Difference]: With dead ends: 19569 [2025-03-16 20:04:34,210 INFO L226 Difference]: Without dead ends: 14160 [2025-03-16 20:04:34,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:34,231 INFO L435 NwaCegarLoop]: 4568 mSDtfsCounter, 4815 mSDsluCounter, 13730 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4832 SdHoareTripleChecker+Valid, 18298 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:34,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4832 Valid, 18298 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2025-03-16 20:04:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13850. [2025-03-16 20:04:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.7029679831736386) internal successors, (21861), 13052 states have internal predecessors, (21861), 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-16 20:04:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24085 transitions. [2025-03-16 20:04:34,739 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24085 transitions. Word has length 132 [2025-03-16 20:04:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:34,739 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24085 transitions. [2025-03-16 20:04:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24085 transitions. [2025-03-16 20:04:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:34,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:34,746 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] [2025-03-16 20:04:34,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:04:34,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:34,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1519915582, now seen corresponding path program 1 times [2025-03-16 20:04:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554680784] [2025-03-16 20:04:34,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:34,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:34,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:34,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:34,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554680784] [2025-03-16 20:04:34,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554680784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812123601] [2025-03-16 20:04:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:34,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:34,848 INFO L87 Difference]: Start difference. First operand 13850 states and 24085 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:35,420 INFO L93 Difference]: Finished difference Result 28994 states and 51402 transitions. [2025-03-16 20:04:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:35,491 INFO L225 Difference]: With dead ends: 28994 [2025-03-16 20:04:35,491 INFO L226 Difference]: Without dead ends: 17280 [2025-03-16 20:04:35,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:35,527 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4577 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 12789 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:35,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 12789 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17280 states. [2025-03-16 20:04:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17280 to 13850. [2025-03-16 20:04:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.700397289086235) internal successors, (21828), 13052 states have internal predecessors, (21828), 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-16 20:04:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24052 transitions. [2025-03-16 20:04:36,217 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24052 transitions. Word has length 132 [2025-03-16 20:04:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:36,218 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24052 transitions. [2025-03-16 20:04:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24052 transitions. [2025-03-16 20:04:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:36,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:36,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:36,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:04:36,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:36,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1698498305, now seen corresponding path program 1 times [2025-03-16 20:04:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:36,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123946240] [2025-03-16 20:04:36,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:36,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:36,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:36,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123946240] [2025-03-16 20:04:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123946240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148056851] [2025-03-16 20:04:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:36,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:36,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:36,375 INFO L87 Difference]: Start difference. First operand 13850 states and 24052 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:37,076 INFO L93 Difference]: Finished difference Result 28749 states and 50846 transitions. [2025-03-16 20:04:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:37,129 INFO L225 Difference]: With dead ends: 28749 [2025-03-16 20:04:37,130 INFO L226 Difference]: Without dead ends: 17035 [2025-03-16 20:04:37,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:37,153 INFO L435 NwaCegarLoop]: 4303 mSDtfsCounter, 4574 mSDsluCounter, 8478 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4591 SdHoareTripleChecker+Valid, 12781 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:37,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4591 Valid, 12781 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17035 states. [2025-03-16 20:04:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17035 to 13850. [2025-03-16 20:04:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.6978265949988316) internal successors, (21795), 13052 states have internal predecessors, (21795), 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-16 20:04:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24019 transitions. [2025-03-16 20:04:37,707 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24019 transitions. Word has length 132 [2025-03-16 20:04:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24019 transitions. [2025-03-16 20:04:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24019 transitions. [2025-03-16 20:04:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:37,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:37,713 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] [2025-03-16 20:04:37,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:04:37,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:37,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 137344542, now seen corresponding path program 1 times [2025-03-16 20:04:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881061299] [2025-03-16 20:04:37,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:37,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:37,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:37,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881061299] [2025-03-16 20:04:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881061299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:37,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841566876] [2025-03-16 20:04:37,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:37,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:37,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:37,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:37,834 INFO L87 Difference]: Start difference. First operand 13850 states and 24019 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:39,123 INFO L93 Difference]: Finished difference Result 41898 states and 74018 transitions. [2025-03-16 20:04:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:39,230 INFO L225 Difference]: With dead ends: 41898 [2025-03-16 20:04:39,231 INFO L226 Difference]: Without dead ends: 30184 [2025-03-16 20:04:39,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:39,265 INFO L435 NwaCegarLoop]: 4549 mSDtfsCounter, 5045 mSDsluCounter, 13672 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 18221 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:39,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 18221 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30184 states. [2025-03-16 20:04:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30184 to 27822. [2025-03-16 20:04:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 25619 states have (on average 1.7040868105702798) internal successors, (43657), 26288 states have internal predecessors, (43657), 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-16 20:04:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 50041 transitions. [2025-03-16 20:04:40,154 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 50041 transitions. Word has length 132 [2025-03-16 20:04:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 27822 states and 50041 transitions. [2025-03-16 20:04:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 50041 transitions. [2025-03-16 20:04:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:40,164 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] [2025-03-16 20:04:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:04:40,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 831991549, now seen corresponding path program 1 times [2025-03-16 20:04:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:40,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339850835] [2025-03-16 20:04:40,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:40,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:40,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:40,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:40,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339850835] [2025-03-16 20:04:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339850835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:40,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:40,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715599926] [2025-03-16 20:04:40,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:40,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:40,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:40,261 INFO L87 Difference]: Start difference. First operand 27822 states and 50041 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:41,927 INFO L93 Difference]: Finished difference Result 60818 states and 112752 transitions. [2025-03-16 20:04:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:42,052 INFO L225 Difference]: With dead ends: 60818 [2025-03-16 20:04:42,053 INFO L226 Difference]: Without dead ends: 35132 [2025-03-16 20:04:42,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:42,108 INFO L435 NwaCegarLoop]: 4296 mSDtfsCounter, 4567 mSDsluCounter, 8463 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4584 SdHoareTripleChecker+Valid, 12759 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:42,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4584 Valid, 12759 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35132 states. [2025-03-16 20:04:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35132 to 27822. [2025-03-16 20:04:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 25619 states have (on average 1.7015496311331433) internal successors, (43592), 26288 states have internal predecessors, (43592), 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-16 20:04:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 49976 transitions. [2025-03-16 20:04:43,480 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 49976 transitions. Word has length 132 [2025-03-16 20:04:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:43,482 INFO L471 AbstractCegarLoop]: Abstraction has 27822 states and 49976 transitions. [2025-03-16 20:04:43,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 49976 transitions. [2025-03-16 20:04:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:43,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:43,494 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] [2025-03-16 20:04:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:04:43,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1962778174, now seen corresponding path program 1 times [2025-03-16 20:04:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443626794] [2025-03-16 20:04:43,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:43,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:43,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:43,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443626794] [2025-03-16 20:04:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443626794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514612049] [2025-03-16 20:04:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:43,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:43,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:43,650 INFO L87 Difference]: Start difference. First operand 27822 states and 49976 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:46,148 INFO L93 Difference]: Finished difference Result 89008 states and 166579 transitions. [2025-03-16 20:04:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:46,583 INFO L225 Difference]: With dead ends: 89008 [2025-03-16 20:04:46,584 INFO L226 Difference]: Without dead ends: 63322 [2025-03-16 20:04:46,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:46,676 INFO L435 NwaCegarLoop]: 4541 mSDtfsCounter, 4978 mSDsluCounter, 13649 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5005 SdHoareTripleChecker+Valid, 18190 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:46,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5005 Valid, 18190 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:04:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63322 states. [2025-03-16 20:04:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63322 to 59558. [2025-03-16 20:04:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7144586489609508) internal successors, (93474), 56584 states have internal predecessors, (93474), 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-16 20:04:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114258 transitions. [2025-03-16 20:04:49,061 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114258 transitions. Word has length 132 [2025-03-16 20:04:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:49,062 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114258 transitions. [2025-03-16 20:04:49,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114258 transitions. [2025-03-16 20:04:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:49,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:49,078 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] [2025-03-16 20:04:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:04:49,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1029423837, now seen corresponding path program 1 times [2025-03-16 20:04:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206933566] [2025-03-16 20:04:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:49,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:49,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:49,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206933566] [2025-03-16 20:04:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206933566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123151159] [2025-03-16 20:04:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:49,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:49,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:49,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:49,170 INFO L87 Difference]: Start difference. First operand 59558 states and 114258 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:52,400 INFO L93 Difference]: Finished difference Result 134492 states and 269632 transitions. [2025-03-16 20:04:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:04:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:52,769 INFO L225 Difference]: With dead ends: 134492 [2025-03-16 20:04:52,769 INFO L226 Difference]: Without dead ends: 77070 [2025-03-16 20:04:52,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:52,942 INFO L435 NwaCegarLoop]: 4291 mSDtfsCounter, 4563 mSDsluCounter, 8454 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4580 SdHoareTripleChecker+Valid, 12745 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:52,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4580 Valid, 12745 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77070 states. [2025-03-16 20:04:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77070 to 59558. [2025-03-16 20:04:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7120925881770328) internal successors, (93345), 56584 states have internal predecessors, (93345), 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-16 20:04:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114129 transitions. [2025-03-16 20:04:56,546 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114129 transitions. Word has length 132 [2025-03-16 20:04:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:56,551 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114129 transitions. [2025-03-16 20:04:56,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114129 transitions. [2025-03-16 20:04:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:04:56,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:56,596 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] [2025-03-16 20:04:56,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:04:56,597 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:56,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1771631010, now seen corresponding path program 1 times [2025-03-16 20:04:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84749777] [2025-03-16 20:04:56,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:56,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:04:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:04:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84749777] [2025-03-16 20:04:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84749777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:56,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:56,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084932142] [2025-03-16 20:04:56,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:56,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:56,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:56,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:56,738 INFO L87 Difference]: Start difference. First operand 59558 states and 114129 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:00,444 INFO L93 Difference]: Finished difference Result 132303 states and 264996 transitions. [2025-03-16 20:05:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:05:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:00,812 INFO L225 Difference]: With dead ends: 132303 [2025-03-16 20:05:00,812 INFO L226 Difference]: Without dead ends: 74881 [2025-03-16 20:05:00,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:05:00,974 INFO L435 NwaCegarLoop]: 4288 mSDtfsCounter, 4560 mSDsluCounter, 8449 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4577 SdHoareTripleChecker+Valid, 12737 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:00,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4577 Valid, 12737 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:05:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74881 states. [2025-03-16 20:05:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74881 to 59558. [2025-03-16 20:05:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7097265273931146) internal successors, (93216), 56584 states have internal predecessors, (93216), 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-16 20:05:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114000 transitions. [2025-03-16 20:05:04,187 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114000 transitions. Word has length 132 [2025-03-16 20:05:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:04,188 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114000 transitions. [2025-03-16 20:05:04,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114000 transitions. [2025-03-16 20:05:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:05:04,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:04,201 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] [2025-03-16 20:05:04,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:05:04,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:04,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1324601021, now seen corresponding path program 1 times [2025-03-16 20:05:04,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:04,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671609925] [2025-03-16 20:05:04,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:05:04,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:05:04,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:04,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:05:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671609925] [2025-03-16 20:05:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671609925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:04,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:04,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:05:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785167995] [2025-03-16 20:05:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:05:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:04,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:05:04,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:05:04,283 INFO L87 Difference]: Start difference. First operand 59558 states and 114000 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:09,424 INFO L93 Difference]: Finished difference Result 191600 states and 393589 transitions. [2025-03-16 20:05:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:05:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 132 [2025-03-16 20:05:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:10,082 INFO L225 Difference]: With dead ends: 191600 [2025-03-16 20:05:10,082 INFO L226 Difference]: Without dead ends: 134178 [2025-03-16 20:05:10,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:05:10,332 INFO L435 NwaCegarLoop]: 4528 mSDtfsCounter, 4795 mSDsluCounter, 13612 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4811 SdHoareTripleChecker+Valid, 18140 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:10,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4811 Valid, 18140 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:05:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134178 states. [2025-03-16 20:05:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134178 to 129399. [2025-03-16 20:05:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129399 states, 117300 states have (on average 1.7159420289855072) internal successors, (201280), 123609 states have internal predecessors, (201280), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 7848 states have return successors, (69783), 4502 states have call predecessors, (69783), 4247 states have call successors, (69783)