./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:56:51,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:56:51,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:56:51,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:56:51,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:56:51,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:56:51,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:56:51,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:56:51,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:56:51,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:56:51,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:56:51,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:56:51,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:56:51,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:56:51,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:56:51,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:56:51,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:56:51,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:56:51,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:56:51,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:56:51,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:56:51,621 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 -> 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b [2025-03-16 19:56:51,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:56:51,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:56:51,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:56:51,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:56:51,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:56:51,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2025-03-16 19:56:53,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd83de09/f0d05799b46f4374bd1d7e2de3feb72e/FLAGb770088ab [2025-03-16 19:56:53,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:56:53,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2025-03-16 19:56:53,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd83de09/f0d05799b46f4374bd1d7e2de3feb72e/FLAGb770088ab [2025-03-16 19:56:53,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd83de09/f0d05799b46f4374bd1d7e2de3feb72e [2025-03-16 19:56:53,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:56:53,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:56:53,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:56:53,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:56:53,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:56:53,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:56:53" (1/1) ... [2025-03-16 19:56:53,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5521b8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:53, skipping insertion in model container [2025-03-16 19:56:53,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:56:53" (1/1) ... [2025-03-16 19:56:53,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:56:54,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[378560,378573] [2025-03-16 19:56:54,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[383339,383352] [2025-03-16 19:56:55,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:56:55,084 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:56:55,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[378560,378573] [2025-03-16 19:56:55,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[383339,383352] [2025-03-16 19:56:55,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:56:55,634 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:56:55,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55 WrapperNode [2025-03-16 19:56:55,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:56:55,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:56:55,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:56:55,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:56:55,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:55,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:55,988 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-03-16 19:56:55,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:56:55,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:56:55,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:56:55,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:56:55,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:55,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:56:56,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:56:56,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:56:56,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:56:56,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:56:56,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (1/1) ... [2025-03-16 19:56:56,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:56:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:56:56,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:56:56,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:56:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:56:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:56:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:56:56,539 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:56:56,541 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:57:02,186 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:57:02,186 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:57:02,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:57:02,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:57:02,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:57:02,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:57:02,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:57:02,376 INFO L? ?]: Removed 1700 outVars from TransFormulas that were not future-live. [2025-03-16 19:57:02,377 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:57:02,426 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:57:02,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:57:02,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:02 BoogieIcfgContainer [2025-03-16 19:57:02,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:57:02,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:57:02,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:57:02,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:57:02,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:56:53" (1/3) ... [2025-03-16 19:57:02,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe43992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:02, skipping insertion in model container [2025-03-16 19:57:02,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:55" (2/3) ... [2025-03-16 19:57:02,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe43992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:02, skipping insertion in model container [2025-03-16 19:57:02,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:02" (3/3) ... [2025-03-16 19:57:02,435 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.04.cil-1.c [2025-03-16 19:57:02,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:57:02,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.04.cil-1.c that has 7 procedures, 2292 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-16 19:57:02,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:57:02,554 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;@559ef56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:57:02,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:57:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 2292 states, 2266 states have (on average 1.8773168578993822) internal successors, (4254), 2268 states have internal predecessors, (4254), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 19:57:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:02,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:02,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:02,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2054451227, now seen corresponding path program 1 times [2025-03-16 19:57:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049006831] [2025-03-16 19:57:02,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:02,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:02,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:02,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:02,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049006831] [2025-03-16 19:57:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049006831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:02,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:57:02,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494516014] [2025-03-16 19:57:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:02,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:02,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:57:02,852 INFO L87 Difference]: Start difference. First operand has 2292 states, 2266 states have (on average 1.8773168578993822) internal successors, (4254), 2268 states have internal predecessors, (4254), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:02,989 INFO L93 Difference]: Finished difference Result 4580 states and 8570 transitions. [2025-03-16 19:57:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:57:02,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2025-03-16 19:57:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:03,011 INFO L225 Difference]: With dead ends: 4580 [2025-03-16 19:57:03,011 INFO L226 Difference]: Without dead ends: 2287 [2025-03-16 19:57:03,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:57:03,020 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 254 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:03,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 8181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-03-16 19:57:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2025-03-16 19:57:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2261 states have (on average 1.8474126492702345) internal successors, (4177), 2263 states have internal predecessors, (4177), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 19:57:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4213 transitions. [2025-03-16 19:57:03,183 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4213 transitions. Word has length 81 [2025-03-16 19:57:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:03,184 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4213 transitions. [2025-03-16 19:57:03,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4213 transitions. [2025-03-16 19:57:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:03,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:03,188 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] [2025-03-16 19:57:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:57:03,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1284994790, now seen corresponding path program 1 times [2025-03-16 19:57:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:03,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626459390] [2025-03-16 19:57:03,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:03,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:03,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626459390] [2025-03-16 19:57:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626459390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486954745] [2025-03-16 19:57:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:03,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:03,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:03,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:03,408 INFO L87 Difference]: Start difference. First operand 2287 states and 4213 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-16 19:57:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:03,715 INFO L93 Difference]: Finished difference Result 2616 states and 4726 transitions. [2025-03-16 19:57:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:57:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:03,726 INFO L225 Difference]: With dead ends: 2616 [2025-03-16 19:57:03,727 INFO L226 Difference]: Without dead ends: 2460 [2025-03-16 19:57:03,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:03,730 INFO L435 NwaCegarLoop]: 4156 mSDtfsCounter, 4410 mSDsluCounter, 8404 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 12560 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:03,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 12560 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-03-16 19:57:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2447. [2025-03-16 19:57:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2401 states have (on average 1.831320283215327) internal successors, (4397), 2404 states have internal predecessors, (4397), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-16 19:57:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4460 transitions. [2025-03-16 19:57:03,789 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4460 transitions. Word has length 81 [2025-03-16 19:57:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:03,789 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 4460 transitions. [2025-03-16 19:57:03,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-16 19:57:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4460 transitions. [2025-03-16 19:57:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:03,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:03,791 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] [2025-03-16 19:57:03,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:57:03,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1993894342, now seen corresponding path program 1 times [2025-03-16 19:57:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841778413] [2025-03-16 19:57:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:03,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:03,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:03,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:03,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841778413] [2025-03-16 19:57:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841778413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156996159] [2025-03-16 19:57:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:03,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:03,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:03,925 INFO L87 Difference]: Start difference. First operand 2447 states and 4460 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:04,132 INFO L93 Difference]: Finished difference Result 2793 states and 5004 transitions. [2025-03-16 19:57:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:04,142 INFO L225 Difference]: With dead ends: 2793 [2025-03-16 19:57:04,142 INFO L226 Difference]: Without dead ends: 2477 [2025-03-16 19:57:04,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:04,145 INFO L435 NwaCegarLoop]: 4127 mSDtfsCounter, 4301 mSDsluCounter, 8198 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4313 SdHoareTripleChecker+Valid, 12325 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:04,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4313 Valid, 12325 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-16 19:57:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2447. [2025-03-16 19:57:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2401 states have (on average 1.8304872969596002) internal successors, (4395), 2404 states have internal predecessors, (4395), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-16 19:57:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4458 transitions. [2025-03-16 19:57:04,206 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4458 transitions. Word has length 81 [2025-03-16 19:57:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 4458 transitions. [2025-03-16 19:57:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4458 transitions. [2025-03-16 19:57:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:04,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:04,213 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] [2025-03-16 19:57:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:57:04,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1692996091, now seen corresponding path program 1 times [2025-03-16 19:57:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310541667] [2025-03-16 19:57:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:04,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:04,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:04,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310541667] [2025-03-16 19:57:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310541667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:04,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469170264] [2025-03-16 19:57:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:04,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:04,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:04,331 INFO L87 Difference]: Start difference. First operand 2447 states and 4458 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:04,728 INFO L93 Difference]: Finished difference Result 2960 states and 5253 transitions. [2025-03-16 19:57:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:04,738 INFO L225 Difference]: With dead ends: 2960 [2025-03-16 19:57:04,738 INFO L226 Difference]: Without dead ends: 2644 [2025-03-16 19:57:04,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-16 19:57:04,741 INFO L435 NwaCegarLoop]: 4282 mSDtfsCounter, 4396 mSDsluCounter, 12827 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 17109 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:04,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4408 Valid, 17109 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2025-03-16 19:57:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2595. [2025-03-16 19:57:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2529 states have (on average 1.8149466192170818) internal successors, (4590), 2533 states have internal predecessors, (4590), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-16 19:57:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4682 transitions. [2025-03-16 19:57:04,801 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4682 transitions. Word has length 81 [2025-03-16 19:57:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 4682 transitions. [2025-03-16 19:57:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4682 transitions. [2025-03-16 19:57:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:04,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:04,803 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] [2025-03-16 19:57:04,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:57:04,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -820471270, now seen corresponding path program 1 times [2025-03-16 19:57:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627616687] [2025-03-16 19:57:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:04,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:04,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:04,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627616687] [2025-03-16 19:57:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627616687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760193674] [2025-03-16 19:57:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:04,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:04,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:04,901 INFO L87 Difference]: Start difference. First operand 2595 states and 4682 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:05,354 INFO L93 Difference]: Finished difference Result 3423 states and 5962 transitions. [2025-03-16 19:57:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:05,368 INFO L225 Difference]: With dead ends: 3423 [2025-03-16 19:57:05,368 INFO L226 Difference]: Without dead ends: 2959 [2025-03-16 19:57:05,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:57:05,371 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4391 mSDsluCounter, 12815 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 17093 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:05,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 17093 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-16 19:57:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2906. [2025-03-16 19:57:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2798 states have (on average 1.7880629020729093) internal successors, (5003), 2806 states have internal predecessors, (5003), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-16 19:57:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 5159 transitions. [2025-03-16 19:57:05,467 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 5159 transitions. Word has length 81 [2025-03-16 19:57:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:05,468 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 5159 transitions. [2025-03-16 19:57:05,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 5159 transitions. [2025-03-16 19:57:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:05,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:05,469 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] [2025-03-16 19:57:05,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:57:05,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:05,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 483922459, now seen corresponding path program 1 times [2025-03-16 19:57:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590743421] [2025-03-16 19:57:05,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:05,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:05,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590743421] [2025-03-16 19:57:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590743421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681023791] [2025-03-16 19:57:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:05,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:05,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:05,597 INFO L87 Difference]: Start difference. First operand 2906 states and 5159 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:06,103 INFO L93 Difference]: Finished difference Result 4404 states and 7493 transitions. [2025-03-16 19:57:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:06,119 INFO L225 Difference]: With dead ends: 4404 [2025-03-16 19:57:06,119 INFO L226 Difference]: Without dead ends: 3629 [2025-03-16 19:57:06,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:57:06,125 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 4386 mSDsluCounter, 12806 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 17081 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:06,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 17081 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2025-03-16 19:57:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3567. [2025-03-16 19:57:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3369 states have (on average 1.7474027901454439) internal successors, (5887), 3391 states have internal predecessors, (5887), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-16 19:57:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 6195 transitions. [2025-03-16 19:57:06,275 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 6195 transitions. Word has length 81 [2025-03-16 19:57:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 3567 states and 6195 transitions. [2025-03-16 19:57:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 6195 transitions. [2025-03-16 19:57:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:06,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:06,278 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] [2025-03-16 19:57:06,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:57:06,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1690757638, now seen corresponding path program 1 times [2025-03-16 19:57:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935129268] [2025-03-16 19:57:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:06,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:06,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:06,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935129268] [2025-03-16 19:57:06,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935129268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:06,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187342297] [2025-03-16 19:57:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:06,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:06,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:06,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:06,380 INFO L87 Difference]: Start difference. First operand 3567 states and 6195 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:06,885 INFO L93 Difference]: Finished difference Result 6727 states and 11224 transitions. [2025-03-16 19:57:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:06,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:06,905 INFO L225 Difference]: With dead ends: 6727 [2025-03-16 19:57:06,906 INFO L226 Difference]: Without dead ends: 5291 [2025-03-16 19:57:06,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:57:06,912 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4419 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 17056 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:06,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 17056 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2025-03-16 19:57:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 4964. [2025-03-16 19:57:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4576 states have (on average 1.6999562937062938) internal successors, (7779), 4644 states have internal predecessors, (7779), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-16 19:57:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8471 transitions. [2025-03-16 19:57:07,052 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8471 transitions. Word has length 81 [2025-03-16 19:57:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:07,053 INFO L471 AbstractCegarLoop]: Abstraction has 4964 states and 8471 transitions. [2025-03-16 19:57:07,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8471 transitions. [2025-03-16 19:57:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:07,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:07,055 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] [2025-03-16 19:57:07,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:57:07,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1899455941, now seen corresponding path program 1 times [2025-03-16 19:57:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:07,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142004361] [2025-03-16 19:57:07,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:07,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:07,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:07,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:07,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142004361] [2025-03-16 19:57:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142004361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:07,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:07,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935178308] [2025-03-16 19:57:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:07,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:07,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:07,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:07,129 INFO L87 Difference]: Start difference. First operand 4964 states and 8471 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:07,442 INFO L93 Difference]: Finished difference Result 8212 states and 13841 transitions. [2025-03-16 19:57:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:07,474 INFO L225 Difference]: With dead ends: 8212 [2025-03-16 19:57:07,474 INFO L226 Difference]: Without dead ends: 5379 [2025-03-16 19:57:07,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:07,488 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 4275 mSDsluCounter, 8194 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4287 SdHoareTripleChecker+Valid, 12329 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:07,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4287 Valid, 12329 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2025-03-16 19:57:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4964. [2025-03-16 19:57:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4576 states have (on average 1.6962412587412588) internal successors, (7762), 4644 states have internal predecessors, (7762), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-16 19:57:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8454 transitions. [2025-03-16 19:57:07,667 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8454 transitions. Word has length 81 [2025-03-16 19:57:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:07,667 INFO L471 AbstractCegarLoop]: Abstraction has 4964 states and 8454 transitions. [2025-03-16 19:57:07,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8454 transitions. [2025-03-16 19:57:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:07,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:07,672 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] [2025-03-16 19:57:07,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:57:07,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:07,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 587663834, now seen corresponding path program 1 times [2025-03-16 19:57:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82327872] [2025-03-16 19:57:07,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:07,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:07,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:07,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:07,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:07,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82327872] [2025-03-16 19:57:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82327872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486492898] [2025-03-16 19:57:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:07,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:07,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:07,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:07,752 INFO L87 Difference]: Start difference. First operand 4964 states and 8454 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:08,312 INFO L93 Difference]: Finished difference Result 11122 states and 18615 transitions. [2025-03-16 19:57:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:08,336 INFO L225 Difference]: With dead ends: 11122 [2025-03-16 19:57:08,337 INFO L226 Difference]: Without dead ends: 8289 [2025-03-16 19:57:08,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:57:08,345 INFO L435 NwaCegarLoop]: 4262 mSDtfsCounter, 4433 mSDsluCounter, 12763 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 17025 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:08,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 17025 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2025-03-16 19:57:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 7896. [2025-03-16 19:57:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6475571872352444) internal successors, (11668), 7296 states have internal predecessors, (11668), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13496 transitions. [2025-03-16 19:57:08,613 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13496 transitions. Word has length 81 [2025-03-16 19:57:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:08,614 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13496 transitions. [2025-03-16 19:57:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13496 transitions. [2025-03-16 19:57:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:08,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:08,619 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] [2025-03-16 19:57:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:57:08,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:08,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -579032485, now seen corresponding path program 1 times [2025-03-16 19:57:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374490854] [2025-03-16 19:57:08,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:08,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374490854] [2025-03-16 19:57:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374490854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:08,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:08,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076855808] [2025-03-16 19:57:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:08,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:08,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:08,675 INFO L87 Difference]: Start difference. First operand 7896 states and 13496 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:09,071 INFO L93 Difference]: Finished difference Result 14396 states and 24845 transitions. [2025-03-16 19:57:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:09,100 INFO L225 Difference]: With dead ends: 14396 [2025-03-16 19:57:09,100 INFO L226 Difference]: Without dead ends: 8631 [2025-03-16 19:57:09,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:09,113 INFO L435 NwaCegarLoop]: 4130 mSDtfsCounter, 4271 mSDsluCounter, 8185 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 12315 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:09,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 12315 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2025-03-16 19:57:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 7896. [2025-03-16 19:57:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6428974865857102) internal successors, (11635), 7296 states have internal predecessors, (11635), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13463 transitions. [2025-03-16 19:57:09,393 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13463 transitions. Word has length 81 [2025-03-16 19:57:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:09,393 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13463 transitions. [2025-03-16 19:57:09,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13463 transitions. [2025-03-16 19:57:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:09,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:09,397 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] [2025-03-16 19:57:09,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:57:09,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:09,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash -478120518, now seen corresponding path program 1 times [2025-03-16 19:57:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:09,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652419443] [2025-03-16 19:57:09,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:09,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:09,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:09,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652419443] [2025-03-16 19:57:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652419443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694314395] [2025-03-16 19:57:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:09,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:09,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:09,455 INFO L87 Difference]: Start difference. First operand 7896 states and 13463 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:09,986 INFO L93 Difference]: Finished difference Result 14151 states and 24289 transitions. [2025-03-16 19:57:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2025-03-16 19:57:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:10,020 INFO L225 Difference]: With dead ends: 14151 [2025-03-16 19:57:10,020 INFO L226 Difference]: Without dead ends: 8386 [2025-03-16 19:57:10,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:10,039 INFO L435 NwaCegarLoop]: 4124 mSDtfsCounter, 4269 mSDsluCounter, 8177 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4281 SdHoareTripleChecker+Valid, 12301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:10,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4281 Valid, 12301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-16 19:57:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 7896. [2025-03-16 19:57:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6382377859361763) internal successors, (11602), 7296 states have internal predecessors, (11602), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13430 transitions. [2025-03-16 19:57:10,382 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13430 transitions. Word has length 81 [2025-03-16 19:57:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:10,383 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13430 transitions. [2025-03-16 19:57:10,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-16 19:57:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13430 transitions. [2025-03-16 19:57:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:10,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:10,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:57:10,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -197770629, now seen corresponding path program 1 times [2025-03-16 19:57:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519848340] [2025-03-16 19:57:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:10,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519848340] [2025-03-16 19:57:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519848340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976833209] [2025-03-16 19:57:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:10,434 INFO L87 Difference]: Start difference. First operand 7896 states and 13430 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:10,671 INFO L93 Difference]: Finished difference Result 13726 states and 23184 transitions. [2025-03-16 19:57:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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 81 [2025-03-16 19:57:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:10,695 INFO L225 Difference]: With dead ends: 13726 [2025-03-16 19:57:10,695 INFO L226 Difference]: Without dead ends: 7962 [2025-03-16 19:57:10,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:10,709 INFO L435 NwaCegarLoop]: 4207 mSDtfsCounter, 0 mSDsluCounter, 8409 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12616 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:10,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12616 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2025-03-16 19:57:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7962. [2025-03-16 19:57:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7962 states, 7148 states have (on average 1.6323447118074985) internal successors, (11668), 7362 states have internal predecessors, (11668), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7962 states to 7962 states and 13496 transitions. [2025-03-16 19:57:10,964 INFO L78 Accepts]: Start accepts. Automaton has 7962 states and 13496 transitions. Word has length 81 [2025-03-16 19:57:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:10,964 INFO L471 AbstractCegarLoop]: Abstraction has 7962 states and 13496 transitions. [2025-03-16 19:57:10,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7962 states and 13496 transitions. [2025-03-16 19:57:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:10,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:10,970 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] [2025-03-16 19:57:10,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:57:10,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash 935419964, now seen corresponding path program 1 times [2025-03-16 19:57:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760205910] [2025-03-16 19:57:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:10,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:10,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:10,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:10,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:11,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760205910] [2025-03-16 19:57:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760205910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:11,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265559926] [2025-03-16 19:57:11,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:11,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:11,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:11,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:11,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:11,011 INFO L87 Difference]: Start difference. First operand 7962 states and 13496 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:11,447 INFO L93 Difference]: Finished difference Result 19504 states and 32520 transitions. [2025-03-16 19:57:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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 81 [2025-03-16 19:57:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:11,489 INFO L225 Difference]: With dead ends: 19504 [2025-03-16 19:57:11,489 INFO L226 Difference]: Without dead ends: 13674 [2025-03-16 19:57:11,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:11,505 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4397 mSDsluCounter, 4356 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 8777 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:11,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 8777 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13674 states. [2025-03-16 19:57:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13674 to 13639. [2025-03-16 19:57:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13639 states, 12034 states have (on average 1.5871696858899784) internal successors, (19100), 12460 states have internal predecessors, (19100), 783 states have call successors, (783), 396 states have call predecessors, (783), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:57:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13639 states to 13639 states and 22683 transitions. [2025-03-16 19:57:12,026 INFO L78 Accepts]: Start accepts. Automaton has 13639 states and 22683 transitions. Word has length 81 [2025-03-16 19:57:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:12,026 INFO L471 AbstractCegarLoop]: Abstraction has 13639 states and 22683 transitions. [2025-03-16 19:57:12,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13639 states and 22683 transitions. [2025-03-16 19:57:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:12,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:12,030 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] [2025-03-16 19:57:12,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:57:12,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:12,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1011501441, now seen corresponding path program 1 times [2025-03-16 19:57:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969438756] [2025-03-16 19:57:12,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:12,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969438756] [2025-03-16 19:57:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969438756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:12,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:12,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849830345] [2025-03-16 19:57:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:12,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:12,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:12,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:12,073 INFO L87 Difference]: Start difference. First operand 13639 states and 22683 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:12,438 INFO L93 Difference]: Finished difference Result 25212 states and 41873 transitions. [2025-03-16 19:57:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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 81 [2025-03-16 19:57:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:12,483 INFO L225 Difference]: With dead ends: 25212 [2025-03-16 19:57:12,483 INFO L226 Difference]: Without dead ends: 13705 [2025-03-16 19:57:12,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:12,509 INFO L435 NwaCegarLoop]: 4207 mSDtfsCounter, 0 mSDsluCounter, 8409 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12616 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:12,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12616 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13705 states. [2025-03-16 19:57:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13705 to 13705. [2025-03-16 19:57:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13705 states, 12100 states have (on average 1.5812396694214876) internal successors, (19133), 12526 states have internal predecessors, (19133), 783 states have call successors, (783), 396 states have call predecessors, (783), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:57:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13705 states to 13705 states and 22716 transitions. [2025-03-16 19:57:13,374 INFO L78 Accepts]: Start accepts. Automaton has 13705 states and 22716 transitions. Word has length 81 [2025-03-16 19:57:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 13705 states and 22716 transitions. [2025-03-16 19:57:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13705 states and 22716 transitions. [2025-03-16 19:57:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:57:13,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:13,380 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] [2025-03-16 19:57:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:57:13,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2100118558, now seen corresponding path program 1 times [2025-03-16 19:57:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456667702] [2025-03-16 19:57:13,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:57:13,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:57:13,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:13,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456667702] [2025-03-16 19:57:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456667702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:13,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100713851] [2025-03-16 19:57:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:13,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:13,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:13,433 INFO L87 Difference]: Start difference. First operand 13705 states and 22716 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:15,553 INFO L93 Difference]: Finished difference Result 69646 states and 115795 transitions. [2025-03-16 19:57:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:57:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 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 81 [2025-03-16 19:57:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:15,768 INFO L225 Difference]: With dead ends: 69646 [2025-03-16 19:57:15,768 INFO L226 Difference]: Without dead ends: 58073 [2025-03-16 19:57:15,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:57:15,818 INFO L435 NwaCegarLoop]: 4403 mSDtfsCounter, 9066 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9068 SdHoareTripleChecker+Valid, 8945 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:15,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9068 Valid, 8945 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58073 states. [2025-03-16 19:57:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58073 to 57477. [2025-03-16 19:57:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57477 states, 49674 states have (on average 1.5303579337279059) internal successors, (76019), 51994 states have internal predecessors, (76019), 3701 states have call successors, (3701), 1980 states have call predecessors, (3701), 4100 states have return successors, (15062), 3534 states have call predecessors, (15062), 3701 states have call successors, (15062) [2025-03-16 19:57:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57477 states to 57477 states and 94782 transitions. [2025-03-16 19:57:19,046 INFO L78 Accepts]: Start accepts. Automaton has 57477 states and 94782 transitions. Word has length 81 [2025-03-16 19:57:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:19,048 INFO L471 AbstractCegarLoop]: Abstraction has 57477 states and 94782 transitions. [2025-03-16 19:57:19,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 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-16 19:57:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 57477 states and 94782 transitions. [2025-03-16 19:57:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:57:19,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:19,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:57:19,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 780687508, now seen corresponding path program 1 times [2025-03-16 19:57:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163599247] [2025-03-16 19:57:19,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:19,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:57:19,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:57:19,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:19,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 19:57:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163599247] [2025-03-16 19:57:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163599247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:57:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362401604] [2025-03-16 19:57:19,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:57:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:19,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:57:19,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:57:19,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:57:19,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:57:19,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:19,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:57:19,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:57:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:57:19,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:57:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362401604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:57:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:57:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308044752] [2025-03-16 19:57:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:19,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:19,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:19,332 INFO L87 Difference]: Start difference. First operand 57477 states and 94782 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:57:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:24,199 INFO L93 Difference]: Finished difference Result 166516 states and 276311 transitions. [2025-03-16 19:57:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:57:24,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-03-16 19:57:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:24,749 INFO L225 Difference]: With dead ends: 166516 [2025-03-16 19:57:24,749 INFO L226 Difference]: Without dead ends: 111171 [2025-03-16 19:57:24,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:24,936 INFO L435 NwaCegarLoop]: 4206 mSDtfsCounter, 4157 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:24,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4430 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111171 states. [2025-03-16 19:57:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111171 to 110839. [2025-03-16 19:57:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110839 states, 95569 states have (on average 1.5216963659764149) internal successors, (145427), 100207 states have internal predecessors, (145427), 7068 states have call successors, (7068), 3960 states have call predecessors, (7068), 8200 states have return successors, (29495), 6703 states have call predecessors, (29495), 7068 states have call successors, (29495) [2025-03-16 19:57:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110839 states to 110839 states and 181990 transitions. [2025-03-16 19:57:30,848 INFO L78 Accepts]: Start accepts. Automaton has 110839 states and 181990 transitions. Word has length 131 [2025-03-16 19:57:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:30,848 INFO L471 AbstractCegarLoop]: Abstraction has 110839 states and 181990 transitions. [2025-03-16 19:57:30,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:57:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 110839 states and 181990 transitions. [2025-03-16 19:57:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:57:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:30,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:30,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:57:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 19:57:31,123 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1807074316, now seen corresponding path program 1 times [2025-03-16 19:57:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227612955] [2025-03-16 19:57:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:31,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:57:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:57:31,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:31,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 19:57:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227612955] [2025-03-16 19:57:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227612955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:57:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443171408] [2025-03-16 19:57:31,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:31,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:57:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:31,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:57:31,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:57:31,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:57:31,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:57:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:31,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:57:31,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:57:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:57:31,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:57:31,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443171408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:31,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:57:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:57:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943478222] [2025-03-16 19:57:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:31,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:31,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:31,357 INFO L87 Difference]: Start difference. First operand 110839 states and 181990 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)