./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.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 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:52:56,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:52:56,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:52:56,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:52:56,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:52:56,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:52:56,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:52:56,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:52:56,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:52:56,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:52:56,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:52:56,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:52:56,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:52:56,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:52:56,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:52:56,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:52:56,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:52:56,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:52:56,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:52:56,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:52:56,992 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 -> 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 [2025-03-08 06:52:57,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:52:57,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:52:57,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:52:57,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:52:57,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:52:57,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2025-03-08 06:52:58,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3b3c4ed/684774d36e8848cdad86cf86e28eee87/FLAG90a6ddddb [2025-03-08 06:52:59,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:52:59,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2025-03-08 06:52:59,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3b3c4ed/684774d36e8848cdad86cf86e28eee87/FLAG90a6ddddb [2025-03-08 06:52:59,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3b3c4ed/684774d36e8848cdad86cf86e28eee87 [2025-03-08 06:52:59,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:52:59,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:52:59,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:52:59,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:52:59,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:52:59,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:59" (1/1) ... [2025-03-08 06:52:59,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce8d7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:59, skipping insertion in model container [2025-03-08 06:52:59,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:59" (1/1) ... [2025-03-08 06:52:59,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:53:00,686 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_label44+token_ring.06.cil-2.c[377340,377353] [2025-03-08 06:53:00,714 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_label44+token_ring.06.cil-2.c[383339,383352] [2025-03-08 06:53:00,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:00,901 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:53:01,390 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_label44+token_ring.06.cil-2.c[377340,377353] [2025-03-08 06:53:01,394 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_label44+token_ring.06.cil-2.c[383339,383352] [2025-03-08 06:53:01,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:01,456 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:53:01,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01 WrapperNode [2025-03-08 06:53:01,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:53:01,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:01,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:53:01,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:53:01,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:01,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:01,895 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-03-08 06:53:01,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:01,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:53:01,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:53:01,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:53:01,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:01,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:53:02,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:53:02,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:53:02,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:53:02,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:53:02,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (1/1) ... [2025-03-08 06:53:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:53:02,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:02,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:53:02,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:53:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:53:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:53:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:53:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:53:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:53:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:53:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:53:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:53:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:53:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:53:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:53:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:53:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:53:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:53:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:53:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:53:02,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:53:02,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:53:08,903 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:53:08,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:53:09,225 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-03-08 06:53:09,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:53:09,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:53:09,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:53:09,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:09 BoogieIcfgContainer [2025-03-08 06:53:09,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:53:09,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:53:09,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:53:09,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:53:09,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:52:59" (1/3) ... [2025-03-08 06:53:09,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25537b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:09, skipping insertion in model container [2025-03-08 06:53:09,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:01" (2/3) ... [2025-03-08 06:53:09,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25537b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:09, skipping insertion in model container [2025-03-08 06:53:09,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:09" (3/3) ... [2025-03-08 06:53:09,294 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.06.cil-2.c [2025-03-08 06:53:09,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:53:09,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.06.cil-2.c that has 7 procedures, 2413 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-08 06:53:09,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:53:09,484 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;@3051ccaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:53:09,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:53:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 2413 states, 2385 states have (on average 1.8469601677148848) internal successors, (4405), 2387 states have internal predecessors, (4405), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 06:53:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:09,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:09,508 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] [2025-03-08 06:53:09,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1034367371, now seen corresponding path program 1 times [2025-03-08 06:53:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362246485] [2025-03-08 06:53:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:09,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:09,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362246485] [2025-03-08 06:53:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362246485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641427533] [2025-03-08 06:53:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:09,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:09,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:09,985 INFO L87 Difference]: Start difference. First operand has 2413 states, 2385 states have (on average 1.8469601677148848) internal successors, (4405), 2387 states have internal predecessors, (4405), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:10,495 INFO L93 Difference]: Finished difference Result 5050 states and 9253 transitions. [2025-03-08 06:53:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:53:10,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:10,525 INFO L225 Difference]: With dead ends: 5050 [2025-03-08 06:53:10,526 INFO L226 Difference]: Without dead ends: 2581 [2025-03-08 06:53:10,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:10,542 INFO L435 NwaCegarLoop]: 4296 mSDtfsCounter, 4664 mSDsluCounter, 8731 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 13027 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:10,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 13027 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-08 06:53:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2564. [2025-03-08 06:53:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2514 states have (on average 1.819013524264121) internal successors, (4573), 2517 states have internal predecessors, (4573), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-08 06:53:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 4644 transitions. [2025-03-08 06:53:10,693 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 4644 transitions. Word has length 110 [2025-03-08 06:53:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 4644 transitions. [2025-03-08 06:53:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 4644 transitions. [2025-03-08 06:53:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:10,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:10,701 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] [2025-03-08 06:53:10,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:53:10,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:10,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 943412813, now seen corresponding path program 1 times [2025-03-08 06:53:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025218810] [2025-03-08 06:53:10,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:10,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:10,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:10,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:10,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025218810] [2025-03-08 06:53:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025218810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957531079] [2025-03-08 06:53:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:10,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:10,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:10,912 INFO L87 Difference]: Start difference. First operand 2564 states and 4644 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:11,203 INFO L93 Difference]: Finished difference Result 3035 states and 5389 transitions. [2025-03-08 06:53:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:11,219 INFO L225 Difference]: With dead ends: 3035 [2025-03-08 06:53:11,220 INFO L226 Difference]: Without dead ends: 2606 [2025-03-08 06:53:11,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:11,224 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4415 mSDsluCounter, 8335 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4429 SdHoareTripleChecker+Valid, 12550 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:11,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4429 Valid, 12550 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2025-03-08 06:53:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2564. [2025-03-08 06:53:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2514 states have (on average 1.8182179793158313) internal successors, (4571), 2517 states have internal predecessors, (4571), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-08 06:53:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 4642 transitions. [2025-03-08 06:53:11,380 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 4642 transitions. Word has length 110 [2025-03-08 06:53:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:11,380 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 4642 transitions. [2025-03-08 06:53:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 4642 transitions. [2025-03-08 06:53:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:11,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:11,383 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] [2025-03-08 06:53:11,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:53:11,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 929162668, now seen corresponding path program 1 times [2025-03-08 06:53:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661238196] [2025-03-08 06:53:11,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:11,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:11,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:11,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:11,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661238196] [2025-03-08 06:53:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661238196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36404365] [2025-03-08 06:53:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:11,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:11,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:11,585 INFO L87 Difference]: Start difference. First operand 2564 states and 4642 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:12,071 INFO L93 Difference]: Finished difference Result 3264 states and 5738 transitions. [2025-03-08 06:53:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:12,084 INFO L225 Difference]: With dead ends: 3264 [2025-03-08 06:53:12,084 INFO L226 Difference]: Without dead ends: 2835 [2025-03-08 06:53:12,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:12,088 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 4587 mSDsluCounter, 13195 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4601 SdHoareTripleChecker+Valid, 17593 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:12,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4601 Valid, 17593 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-03-08 06:53:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2766. [2025-03-08 06:53:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2694 states have (on average 1.7988121752041575) internal successors, (4846), 2698 states have internal predecessors, (4846), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-08 06:53:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4950 transitions. [2025-03-08 06:53:12,157 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4950 transitions. Word has length 110 [2025-03-08 06:53:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4950 transitions. [2025-03-08 06:53:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4950 transitions. [2025-03-08 06:53:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:12,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:12,159 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] [2025-03-08 06:53:12,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:53:12,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -41128339, now seen corresponding path program 1 times [2025-03-08 06:53:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030159213] [2025-03-08 06:53:12,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:12,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:12,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:12,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030159213] [2025-03-08 06:53:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030159213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:12,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005733519] [2025-03-08 06:53:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:12,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:12,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:12,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:12,297 INFO L87 Difference]: Start difference. First operand 2766 states and 4950 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:12,775 INFO L93 Difference]: Finished difference Result 3901 states and 6723 transitions. [2025-03-08 06:53:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:12,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:12,788 INFO L225 Difference]: With dead ends: 3901 [2025-03-08 06:53:12,788 INFO L226 Difference]: Without dead ends: 3270 [2025-03-08 06:53:12,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:12,792 INFO L435 NwaCegarLoop]: 4394 mSDtfsCounter, 4582 mSDsluCounter, 13183 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4596 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:12,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4596 Valid, 17577 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2025-03-08 06:53:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3193. [2025-03-08 06:53:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3075 states have (on average 1.767479674796748) internal successors, (5435), 3083 states have internal predecessors, (5435), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-08 06:53:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 5611 transitions. [2025-03-08 06:53:12,927 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 5611 transitions. Word has length 110 [2025-03-08 06:53:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:12,927 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 5611 transitions. [2025-03-08 06:53:12,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 5611 transitions. [2025-03-08 06:53:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:12,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:12,929 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] [2025-03-08 06:53:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:53:12,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 897403276, now seen corresponding path program 1 times [2025-03-08 06:53:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150664223] [2025-03-08 06:53:12,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:12,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:12,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150664223] [2025-03-08 06:53:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150664223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:13,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:13,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142787802] [2025-03-08 06:53:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:13,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:13,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:13,064 INFO L87 Difference]: Start difference. First operand 3193 states and 5611 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:13,626 INFO L93 Difference]: Finished difference Result 5262 states and 8870 transitions. [2025-03-08 06:53:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:13,644 INFO L225 Difference]: With dead ends: 5262 [2025-03-08 06:53:13,644 INFO L226 Difference]: Without dead ends: 4204 [2025-03-08 06:53:13,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:13,650 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4577 mSDsluCounter, 13174 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4591 SdHoareTripleChecker+Valid, 17565 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:13,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4591 Valid, 17565 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2025-03-08 06:53:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 4110. [2025-03-08 06:53:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4110 states, 3894 states have (on average 1.7254750898818696) internal successors, (6719), 3916 states have internal predecessors, (6719), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-08 06:53:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 7063 transitions. [2025-03-08 06:53:13,809 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 7063 transitions. Word has length 110 [2025-03-08 06:53:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:13,810 INFO L471 AbstractCegarLoop]: Abstraction has 4110 states and 7063 transitions. [2025-03-08 06:53:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 7063 transitions. [2025-03-08 06:53:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:13,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:13,817 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] [2025-03-08 06:53:13,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:53:13,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash 512036493, now seen corresponding path program 1 times [2025-03-08 06:53:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695176085] [2025-03-08 06:53:13,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:13,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:13,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:13,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695176085] [2025-03-08 06:53:13,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695176085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:13,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:13,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018479619] [2025-03-08 06:53:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:13,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:13,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:13,944 INFO L87 Difference]: Start difference. First operand 4110 states and 7063 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:14,531 INFO L93 Difference]: Finished difference Result 8217 states and 13672 transitions. [2025-03-08 06:53:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:14,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:14,561 INFO L225 Difference]: With dead ends: 8217 [2025-03-08 06:53:14,561 INFO L226 Difference]: Without dead ends: 6242 [2025-03-08 06:53:14,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:14,572 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4596 mSDsluCounter, 12815 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4610 SdHoareTripleChecker+Valid, 17052 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:14,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4610 Valid, 17052 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2025-03-08 06:53:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6115. [2025-03-08 06:53:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 5685 states have (on average 1.6835532102022868) internal successors, (9571), 5753 states have internal predecessors, (9571), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-08 06:53:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 10347 transitions. [2025-03-08 06:53:14,833 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 10347 transitions. Word has length 110 [2025-03-08 06:53:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:14,833 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 10347 transitions. [2025-03-08 06:53:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 10347 transitions. [2025-03-08 06:53:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:14,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:14,837 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] [2025-03-08 06:53:14,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:53:14,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:14,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2132794004, now seen corresponding path program 1 times [2025-03-08 06:53:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233570291] [2025-03-08 06:53:14,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:14,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:14,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233570291] [2025-03-08 06:53:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233570291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373885616] [2025-03-08 06:53:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:14,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:14,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:14,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:14,958 INFO L87 Difference]: Start difference. First operand 6115 states and 10347 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:15,679 INFO L93 Difference]: Finished difference Result 14752 states and 24778 transitions. [2025-03-08 06:53:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:15,726 INFO L225 Difference]: With dead ends: 14752 [2025-03-08 06:53:15,726 INFO L226 Difference]: Without dead ends: 10772 [2025-03-08 06:53:15,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:15,741 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4567 mSDsluCounter, 13156 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 17541 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:15,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 17541 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2025-03-08 06:53:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 10584. [2025-03-08 06:53:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10584 states, 9672 states have (on average 1.656637717121588) internal successors, (16023), 9886 states have internal predecessors, (16023), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-08 06:53:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10584 states to 10584 states and 18047 transitions. [2025-03-08 06:53:16,073 INFO L78 Accepts]: Start accepts. Automaton has 10584 states and 18047 transitions. Word has length 110 [2025-03-08 06:53:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 10584 states and 18047 transitions. [2025-03-08 06:53:16,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 10584 states and 18047 transitions. [2025-03-08 06:53:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:16,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:16,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:16,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:53:16,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash -278448467, now seen corresponding path program 1 times [2025-03-08 06:53:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609415349] [2025-03-08 06:53:16,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:16,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:16,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609415349] [2025-03-08 06:53:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609415349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721838995] [2025-03-08 06:53:16,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:16,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:16,180 INFO L87 Difference]: Start difference. First operand 10584 states and 18047 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:17,007 INFO L93 Difference]: Finished difference Result 30987 states and 53833 transitions. [2025-03-08 06:53:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:17,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:17,087 INFO L225 Difference]: With dead ends: 30987 [2025-03-08 06:53:17,087 INFO L226 Difference]: Without dead ends: 22538 [2025-03-08 06:53:17,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:17,119 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4756 mSDsluCounter, 13136 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 17516 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:17,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 17516 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22538 states. [2025-03-08 06:53:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22538 to 20641. [2025-03-08 06:53:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20641 states, 18635 states have (on average 1.6523209015293803) internal successors, (30791), 19303 states have internal predecessors, (30791), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 06:53:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20641 states to 20641 states and 36783 transitions. [2025-03-08 06:53:17,890 INFO L78 Accepts]: Start accepts. Automaton has 20641 states and 36783 transitions. Word has length 110 [2025-03-08 06:53:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:17,890 INFO L471 AbstractCegarLoop]: Abstraction has 20641 states and 36783 transitions. [2025-03-08 06:53:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20641 states and 36783 transitions. [2025-03-08 06:53:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:17,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:17,900 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] [2025-03-08 06:53:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:53:17,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 889747788, now seen corresponding path program 1 times [2025-03-08 06:53:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960449671] [2025-03-08 06:53:17,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:17,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:17,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960449671] [2025-03-08 06:53:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960449671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164309600] [2025-03-08 06:53:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:17,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:17,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:17,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:17,976 INFO L87 Difference]: Start difference. First operand 20641 states and 36783 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:18,812 INFO L93 Difference]: Finished difference Result 44264 states and 81854 transitions. [2025-03-08 06:53:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:18,914 INFO L225 Difference]: With dead ends: 44264 [2025-03-08 06:53:18,914 INFO L226 Difference]: Without dead ends: 25758 [2025-03-08 06:53:18,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:18,965 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4404 mSDsluCounter, 8304 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4418 SdHoareTripleChecker+Valid, 12504 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:18,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4418 Valid, 12504 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25758 states. [2025-03-08 06:53:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25758 to 20641. [2025-03-08 06:53:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20641 states, 18635 states have (on average 1.6488328414274216) internal successors, (30726), 19303 states have internal predecessors, (30726), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 06:53:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20641 states to 20641 states and 36718 transitions. [2025-03-08 06:53:20,507 INFO L78 Accepts]: Start accepts. Automaton has 20641 states and 36718 transitions. Word has length 110 [2025-03-08 06:53:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:20,508 INFO L471 AbstractCegarLoop]: Abstraction has 20641 states and 36718 transitions. [2025-03-08 06:53:20,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 20641 states and 36718 transitions. [2025-03-08 06:53:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:20,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:20,519 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] [2025-03-08 06:53:20,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:53:20,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -319494451, now seen corresponding path program 1 times [2025-03-08 06:53:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4058520] [2025-03-08 06:53:20,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:20,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:20,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:20,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:20,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4058520] [2025-03-08 06:53:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4058520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83916972] [2025-03-08 06:53:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:20,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:20,635 INFO L87 Difference]: Start difference. First operand 20641 states and 36718 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:22,405 INFO L93 Difference]: Finished difference Result 64318 states and 120564 transitions. [2025-03-08 06:53:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:22,611 INFO L225 Difference]: With dead ends: 64318 [2025-03-08 06:53:22,611 INFO L226 Difference]: Without dead ends: 45812 [2025-03-08 06:53:22,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:22,662 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4683 mSDsluCounter, 13113 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4704 SdHoareTripleChecker+Valid, 17485 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:22,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4704 Valid, 17485 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45812 states. [2025-03-08 06:53:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45812 to 43089. [2025-03-08 06:53:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43089 states, 38441 states have (on average 1.6519861606097657) internal successors, (63504), 40503 states have internal predecessors, (63504), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 06:53:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43089 states to 43089 states and 83512 transitions. [2025-03-08 06:53:24,718 INFO L78 Accepts]: Start accepts. Automaton has 43089 states and 83512 transitions. Word has length 110 [2025-03-08 06:53:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:24,718 INFO L471 AbstractCegarLoop]: Abstraction has 43089 states and 83512 transitions. [2025-03-08 06:53:24,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 43089 states and 83512 transitions. [2025-03-08 06:53:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:24,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:24,756 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] [2025-03-08 06:53:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:53:24,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:24,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 888423724, now seen corresponding path program 1 times [2025-03-08 06:53:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:24,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103805441] [2025-03-08 06:53:24,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:24,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:24,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:24,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:24,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:24,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:24,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103805441] [2025-03-08 06:53:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103805441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:24,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:24,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491269194] [2025-03-08 06:53:24,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:24,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:24,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:24,844 INFO L87 Difference]: Start difference. First operand 43089 states and 83512 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:27,203 INFO L93 Difference]: Finished difference Result 94988 states and 195010 transitions. [2025-03-08 06:53:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:27,552 INFO L225 Difference]: With dead ends: 94988 [2025-03-08 06:53:27,552 INFO L226 Difference]: Without dead ends: 54034 [2025-03-08 06:53:27,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:27,697 INFO L435 NwaCegarLoop]: 4195 mSDtfsCounter, 4400 mSDsluCounter, 8295 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 12490 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:27,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 12490 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54034 states. [2025-03-08 06:53:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54034 to 43089. [2025-03-08 06:53:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43089 states, 38441 states have (on average 1.6486303686168413) internal successors, (63375), 40503 states have internal predecessors, (63375), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 06:53:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43089 states to 43089 states and 83383 transitions. [2025-03-08 06:53:31,485 INFO L78 Accepts]: Start accepts. Automaton has 43089 states and 83383 transitions. Word has length 110 [2025-03-08 06:53:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:31,486 INFO L471 AbstractCegarLoop]: Abstraction has 43089 states and 83383 transitions. [2025-03-08 06:53:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43089 states and 83383 transitions. [2025-03-08 06:53:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:31,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:31,508 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] [2025-03-08 06:53:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:53:31,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -596631827, now seen corresponding path program 1 times [2025-03-08 06:53:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374454836] [2025-03-08 06:53:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:31,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:31,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:31,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374454836] [2025-03-08 06:53:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374454836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401650574] [2025-03-08 06:53:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:31,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:31,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:31,600 INFO L87 Difference]: Start difference. First operand 43089 states and 83383 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:33,974 INFO L93 Difference]: Finished difference Result 92799 states and 190374 transitions. [2025-03-08 06:53:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:34,233 INFO L225 Difference]: With dead ends: 92799 [2025-03-08 06:53:34,234 INFO L226 Difference]: Without dead ends: 51845 [2025-03-08 06:53:34,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:34,354 INFO L435 NwaCegarLoop]: 4192 mSDtfsCounter, 4397 mSDsluCounter, 8290 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 12482 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:34,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 12482 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51845 states. [2025-03-08 06:53:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51845 to 43089. [2025-03-08 06:53:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43089 states, 38441 states have (on average 1.6452745766239172) internal successors, (63246), 40503 states have internal predecessors, (63246), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 06:53:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43089 states to 43089 states and 83254 transitions. [2025-03-08 06:53:37,179 INFO L78 Accepts]: Start accepts. Automaton has 43089 states and 83254 transitions. Word has length 110 [2025-03-08 06:53:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:37,180 INFO L471 AbstractCegarLoop]: Abstraction has 43089 states and 83254 transitions. [2025-03-08 06:53:37,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 43089 states and 83254 transitions. [2025-03-08 06:53:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:53:37,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:37,195 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] [2025-03-08 06:53:37,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:53:37,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:37,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash 186747148, now seen corresponding path program 1 times [2025-03-08 06:53:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:37,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580462997] [2025-03-08 06:53:37,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:37,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:53:37,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:53:37,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:37,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:37,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:37,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580462997] [2025-03-08 06:53:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580462997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:37,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465035984] [2025-03-08 06:53:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:37,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:37,271 INFO L87 Difference]: Start difference. First operand 43089 states and 83254 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:40,991 INFO L93 Difference]: Finished difference Result 133264 states and 283994 transitions. [2025-03-08 06:53:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-03-08 06:53:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:41,549 INFO L225 Difference]: With dead ends: 133264 [2025-03-08 06:53:41,549 INFO L226 Difference]: Without dead ends: 92310 [2025-03-08 06:53:41,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:41,720 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4572 mSDsluCounter, 13076 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4593 SdHoareTripleChecker+Valid, 17435 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:41,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4593 Valid, 17435 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92310 states.