./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:08:24,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:08:24,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:08:24,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:08:24,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:08:24,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:08:24,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:08:24,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:08:24,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:08:24,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:08:24,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:08:24,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:08:24,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:08:24,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:08:24,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:08:24,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:24,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:08:24,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:08:24,541 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-jdk21/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 -> 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 [2025-02-05 17:08:24,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:08:24,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:08:24,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:08:24,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:08:24,784 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:08:24,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2025-02-05 17:08:25,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4185f14a/7ab3c60cacce489b813156cfba674b66/FLAG21fe936b7 [2025-02-05 17:08:26,527 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:08:26,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2025-02-05 17:08:26,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4185f14a/7ab3c60cacce489b813156cfba674b66/FLAG21fe936b7 [2025-02-05 17:08:26,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4185f14a/7ab3c60cacce489b813156cfba674b66 [2025-02-05 17:08:26,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:08:26,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:08:26,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:26,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:08:26,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:08:26,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:26" (1/1) ... [2025-02-05 17:08:26,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a73a201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:26, skipping insertion in model container [2025-02-05 17:08:26,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:26" (1/1) ... [2025-02-05 17:08:26,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:08:27,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2025-02-05 17:08:27,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:08:28,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:28,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:08:28,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2025-02-05 17:08:28,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:08:28,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:28,674 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:08:28,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28 WrapperNode [2025-02-05 17:08:28,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:28,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:28,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:08:28,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:08:28,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:28,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,049 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-02-05 17:08:29,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:29,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:08:29,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:08:29,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:08:29,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,178 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-02-05 17:08:29,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:08:29,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:08:29,490 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:08:29,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:08:29,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (1/1) ... [2025-02-05 17:08:29,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:29,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:08:29,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:08:29,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:08:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:08:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:08:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:08:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:08:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:08:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:08:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:08:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:08:29,667 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:08:29,669 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:08:35,807 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:08:35,807 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:08:35,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:08:35,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:08:35,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:08:35,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:08:35,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:08:36,220 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-02-05 17:08:36,221 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:08:36,322 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:08:36,322 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:08:36,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:36 BoogieIcfgContainer [2025-02-05 17:08:36,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:08:36,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:08:36,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:08:36,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:08:36,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:08:26" (1/3) ... [2025-02-05 17:08:36,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79990a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:36, skipping insertion in model container [2025-02-05 17:08:36,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:28" (2/3) ... [2025-02-05 17:08:36,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79990a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:36, skipping insertion in model container [2025-02-05 17:08:36,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:36" (3/3) ... [2025-02-05 17:08:36,330 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.10.cil-2.c [2025-02-05 17:08:36,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:08:36,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.10.cil-2.c that has 7 procedures, 2537 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:08:36,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:08:36,460 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;@1b2c5968, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:08:36,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:08:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 17:08:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:36,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:36,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:36,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 490995444, now seen corresponding path program 1 times [2025-02-05 17:08:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:36,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867271700] [2025-02-05 17:08:36,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:36,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:36,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867271700] [2025-02-05 17:08:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867271700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638776611] [2025-02-05 17:08:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:37,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:37,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:37,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:37,080 INFO L87 Difference]: Start difference. First operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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-02-05 17:08:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:37,823 INFO L93 Difference]: Finished difference Result 5430 states and 9845 transitions. [2025-02-05 17:08:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:08:37,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:37,841 INFO L225 Difference]: With dead ends: 5430 [2025-02-05 17:08:37,841 INFO L226 Difference]: Without dead ends: 2841 [2025-02-05 17:08:37,849 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-02-05 17:08:37,851 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5028 mSDsluCounter, 9139 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 13587 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:37,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 13587 Invalid, 602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-02-05 17:08:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2816. [2025-02-05 17:08:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7915155910079767) internal successors, (4941), 2761 states have internal predecessors, (4941), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:08:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5028 transitions. [2025-02-05 17:08:37,946 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5028 transitions. Word has length 156 [2025-02-05 17:08:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:37,946 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5028 transitions. [2025-02-05 17:08:37,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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-02-05 17:08:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5028 transitions. [2025-02-05 17:08:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:37,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:37,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:37,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:08:37,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1402295606, now seen corresponding path program 1 times [2025-02-05 17:08:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434405764] [2025-02-05 17:08:37,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:37,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:37,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:37,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434405764] [2025-02-05 17:08:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434405764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:38,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513235337] [2025-02-05 17:08:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:38,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:38,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:38,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:38,158 INFO L87 Difference]: Start difference. First operand 2816 states and 5028 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:38,449 INFO L93 Difference]: Finished difference Result 3559 states and 6197 transitions. [2025-02-05 17:08:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:38,458 INFO L225 Difference]: With dead ends: 3559 [2025-02-05 17:08:38,459 INFO L226 Difference]: Without dead ends: 2882 [2025-02-05 17:08:38,460 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-02-05 17:08:38,461 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4675 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 12966 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:38,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 12966 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-02-05 17:08:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2816. [2025-02-05 17:08:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7907904278462654) internal successors, (4939), 2761 states have internal predecessors, (4939), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:08:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5026 transitions. [2025-02-05 17:08:38,534 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5026 transitions. Word has length 156 [2025-02-05 17:08:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:38,534 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5026 transitions. [2025-02-05 17:08:38,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5026 transitions. [2025-02-05 17:08:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:38,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:38,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:08:38,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1553908267, now seen corresponding path program 1 times [2025-02-05 17:08:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110718773] [2025-02-05 17:08:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:38,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:38,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:38,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:38,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110718773] [2025-02-05 17:08:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110718773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087235327] [2025-02-05 17:08:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:38,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:38,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:38,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:38,767 INFO L87 Difference]: Start difference. First operand 2816 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:39,787 INFO L93 Difference]: Finished difference Result 3924 states and 6758 transitions. [2025-02-05 17:08:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:39,799 INFO L225 Difference]: With dead ends: 3924 [2025-02-05 17:08:39,799 INFO L226 Difference]: Without dead ends: 3247 [2025-02-05 17:08:39,801 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-02-05 17:08:39,801 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 4959 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 18725 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:39,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 18725 Invalid, 980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:08:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-02-05 17:08:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3138. [2025-02-05 17:08:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3054 states have (on average 1.7635887360838245) internal successors, (5386), 3058 states have internal predecessors, (5386), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:08:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5514 transitions. [2025-02-05 17:08:39,858 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5514 transitions. Word has length 156 [2025-02-05 17:08:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:39,858 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5514 transitions. [2025-02-05 17:08:39,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5514 transitions. [2025-02-05 17:08:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:39,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:39,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:08:39,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1372175018, now seen corresponding path program 1 times [2025-02-05 17:08:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10001658] [2025-02-05 17:08:39,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:39,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:40,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:40,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10001658] [2025-02-05 17:08:40,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10001658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:40,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803820633] [2025-02-05 17:08:40,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:40,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:40,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:40,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:40,090 INFO L87 Difference]: Start difference. First operand 3138 states and 5514 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:40,744 INFO L93 Difference]: Finished difference Result 4945 states and 8331 transitions. [2025-02-05 17:08:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:40,766 INFO L225 Difference]: With dead ends: 4945 [2025-02-05 17:08:40,766 INFO L226 Difference]: Without dead ends: 3946 [2025-02-05 17:08:40,771 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-02-05 17:08:40,772 INFO L435 NwaCegarLoop]: 4409 mSDtfsCounter, 4982 mSDsluCounter, 13431 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:40,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5000 Valid, 17840 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-02-05 17:08:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3821. [2025-02-05 17:08:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3683 states have (on average 1.7244094488188977) internal successors, (6351), 3691 states have internal predecessors, (6351), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-02-05 17:08:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6567 transitions. [2025-02-05 17:08:40,883 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6567 transitions. Word has length 156 [2025-02-05 17:08:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6567 transitions. [2025-02-05 17:08:40,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6567 transitions. [2025-02-05 17:08:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:40,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:40,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:40,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:08:40,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1227765323, now seen corresponding path program 1 times [2025-02-05 17:08:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:40,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321994333] [2025-02-05 17:08:40,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:40,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321994333] [2025-02-05 17:08:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321994333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:41,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:41,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693967937] [2025-02-05 17:08:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:41,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:41,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:41,065 INFO L87 Difference]: Start difference. First operand 3821 states and 6567 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:41,690 INFO L93 Difference]: Finished difference Result 7138 states and 11782 transitions. [2025-02-05 17:08:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:41,709 INFO L225 Difference]: With dead ends: 7138 [2025-02-05 17:08:41,710 INFO L226 Difference]: Without dead ends: 5456 [2025-02-05 17:08:41,714 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-02-05 17:08:41,716 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 4949 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4967 SdHoareTripleChecker+Valid, 18697 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:41,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4967 Valid, 18697 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-02-05 17:08:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5298. [2025-02-05 17:08:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5046 states have (on average 1.6811335711454618) internal successors, (8483), 5068 states have internal predecessors, (8483), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-02-05 17:08:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 8899 transitions. [2025-02-05 17:08:41,850 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 8899 transitions. Word has length 156 [2025-02-05 17:08:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:41,850 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 8899 transitions. [2025-02-05 17:08:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 8899 transitions. [2025-02-05 17:08:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:41,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:08:41,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1500201610, now seen corresponding path program 1 times [2025-02-05 17:08:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740283385] [2025-02-05 17:08:41,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:41,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740283385] [2025-02-05 17:08:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740283385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941400249] [2025-02-05 17:08:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:42,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:42,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:42,020 INFO L87 Difference]: Start difference. First operand 5298 states and 8899 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:42,643 INFO L93 Difference]: Finished difference Result 11949 states and 19576 transitions. [2025-02-05 17:08:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:42,672 INFO L225 Difference]: With dead ends: 11949 [2025-02-05 17:08:42,672 INFO L226 Difference]: Without dead ends: 8790 [2025-02-05 17:08:42,684 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-02-05 17:08:42,685 INFO L435 NwaCegarLoop]: 4656 mSDtfsCounter, 4944 mSDsluCounter, 14029 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4962 SdHoareTripleChecker+Valid, 18685 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:42,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4962 Valid, 18685 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2025-02-05 17:08:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8567. [2025-02-05 17:08:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8567 states, 8069 states have (on average 1.6506382451357045) internal successors, (13319), 8137 states have internal predecessors, (13319), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:08:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 14231 transitions. [2025-02-05 17:08:42,876 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 14231 transitions. Word has length 156 [2025-02-05 17:08:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:42,876 INFO L471 AbstractCegarLoop]: Abstraction has 8567 states and 14231 transitions. [2025-02-05 17:08:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 14231 transitions. [2025-02-05 17:08:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:42,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:42,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:08:42,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 984862101, now seen corresponding path program 1 times [2025-02-05 17:08:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251781882] [2025-02-05 17:08:42,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:42,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:42,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:42,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:42,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251781882] [2025-02-05 17:08:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251781882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:42,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:42,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529241484] [2025-02-05 17:08:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:42,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:42,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:42,987 INFO L87 Difference]: Start difference. First operand 8567 states and 14231 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:43,781 INFO L93 Difference]: Finished difference Result 22772 states and 37818 transitions. [2025-02-05 17:08:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:43,827 INFO L225 Difference]: With dead ends: 22772 [2025-02-05 17:08:43,827 INFO L226 Difference]: Without dead ends: 16344 [2025-02-05 17:08:43,847 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-02-05 17:08:43,847 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 4939 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4957 SdHoareTripleChecker+Valid, 18673 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4957 Valid, 18673 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:08:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2025-02-05 17:08:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 15996. [2025-02-05 17:08:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6454654895666132) internal successors, (24603), 15166 states have internal predecessors, (24603), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:08:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26891 transitions. [2025-02-05 17:08:44,247 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26891 transitions. Word has length 156 [2025-02-05 17:08:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:44,247 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26891 transitions. [2025-02-05 17:08:44,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26891 transitions. [2025-02-05 17:08:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:44,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:08:44,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 510836118, now seen corresponding path program 1 times [2025-02-05 17:08:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236801952] [2025-02-05 17:08:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:44,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:44,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:44,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236801952] [2025-02-05 17:08:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236801952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138284873] [2025-02-05 17:08:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:44,326 INFO L87 Difference]: Start difference. First operand 15996 states and 26891 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:44,928 INFO L93 Difference]: Finished difference Result 33773 states and 57990 transitions. [2025-02-05 17:08:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:44,989 INFO L225 Difference]: With dead ends: 33773 [2025-02-05 17:08:44,990 INFO L226 Difference]: Without dead ends: 19916 [2025-02-05 17:08:45,026 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-02-05 17:08:45,027 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4667 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12928 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:45,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 12928 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2025-02-05 17:08:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 15996. [2025-02-05 17:08:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6432584269662922) internal successors, (24570), 15166 states have internal predecessors, (24570), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:08:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26858 transitions. [2025-02-05 17:08:45,561 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26858 transitions. Word has length 156 [2025-02-05 17:08:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:45,562 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26858 transitions. [2025-02-05 17:08:45,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26858 transitions. [2025-02-05 17:08:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:45,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:45,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:45,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:08:45,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:45,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 218450293, now seen corresponding path program 1 times [2025-02-05 17:08:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006727352] [2025-02-05 17:08:45,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:45,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:45,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006727352] [2025-02-05 17:08:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006727352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452415006] [2025-02-05 17:08:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:45,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:45,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:45,645 INFO L87 Difference]: Start difference. First operand 15996 states and 26858 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:46,189 INFO L93 Difference]: Finished difference Result 33528 states and 57434 transitions. [2025-02-05 17:08:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:46,249 INFO L225 Difference]: With dead ends: 33528 [2025-02-05 17:08:46,250 INFO L226 Difference]: Without dead ends: 19671 [2025-02-05 17:08:46,279 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-02-05 17:08:46,280 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4664 mSDsluCounter, 8569 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:46,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 12920 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-02-05 17:08:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 15996. [2025-02-05 17:08:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6410513643659712) internal successors, (24537), 15166 states have internal predecessors, (24537), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:08:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26825 transitions. [2025-02-05 17:08:46,758 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26825 transitions. Word has length 156 [2025-02-05 17:08:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26825 transitions. [2025-02-05 17:08:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26825 transitions. [2025-02-05 17:08:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:46,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:46,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:08:46,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2146286154, now seen corresponding path program 1 times [2025-02-05 17:08:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553013004] [2025-02-05 17:08:46,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:46,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:46,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:46,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:46,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553013004] [2025-02-05 17:08:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553013004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821946975] [2025-02-05 17:08:46,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:46,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:46,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:46,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:46,870 INFO L87 Difference]: Start difference. First operand 15996 states and 26825 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:47,934 INFO L93 Difference]: Finished difference Result 47251 states and 81018 transitions. [2025-02-05 17:08:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:48,059 INFO L225 Difference]: With dead ends: 47251 [2025-02-05 17:08:48,059 INFO L226 Difference]: Without dead ends: 33394 [2025-02-05 17:08:48,096 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-02-05 17:08:48,096 INFO L435 NwaCegarLoop]: 4640 mSDtfsCounter, 4918 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18623 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:48,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18623 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33394 states. [2025-02-05 17:08:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33394 to 32879. [2025-02-05 17:08:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.6542624505411858) internal successors, (50589), 31249 states have internal predecessors, (50589), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:08:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57165 transitions. [2025-02-05 17:08:49,512 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57165 transitions. Word has length 156 [2025-02-05 17:08:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:49,513 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57165 transitions. [2025-02-05 17:08:49,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57165 transitions. [2025-02-05 17:08:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:49,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:49,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:08:49,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:49,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:49,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1933851989, now seen corresponding path program 1 times [2025-02-05 17:08:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:49,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489895886] [2025-02-05 17:08:49,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:49,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:49,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:49,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:49,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489895886] [2025-02-05 17:08:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489895886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691402034] [2025-02-05 17:08:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:49,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:49,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:49,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:49,590 INFO L87 Difference]: Start difference. First operand 32879 states and 57165 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:51,041 INFO L93 Difference]: Finished difference Result 73122 states and 131382 transitions. [2025-02-05 17:08:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:51,178 INFO L225 Difference]: With dead ends: 73122 [2025-02-05 17:08:51,178 INFO L226 Difference]: Without dead ends: 42382 [2025-02-05 17:08:51,242 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-02-05 17:08:51,243 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4660 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 12906 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:51,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 12906 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2025-02-05 17:08:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 32879. [2025-02-05 17:08:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.652136947778032) internal successors, (50524), 31249 states have internal predecessors, (50524), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:08:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57100 transitions. [2025-02-05 17:08:52,755 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57100 transitions. Word has length 156 [2025-02-05 17:08:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:52,755 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57100 transitions. [2025-02-05 17:08:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57100 transitions. [2025-02-05 17:08:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:52,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:52,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:52,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:08:52,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:52,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash -566929962, now seen corresponding path program 1 times [2025-02-05 17:08:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935294221] [2025-02-05 17:08:52,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:52,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:52,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:52,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935294221] [2025-02-05 17:08:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935294221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853610616] [2025-02-05 17:08:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:52,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:52,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:52,977 INFO L87 Difference]: Start difference. First operand 32879 states and 57100 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:55,606 INFO L93 Difference]: Finished difference Result 108360 states and 195178 transitions. [2025-02-05 17:08:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:08:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:55,815 INFO L225 Difference]: With dead ends: 108360 [2025-02-05 17:08:55,816 INFO L226 Difference]: Without dead ends: 77620 [2025-02-05 17:08:55,865 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-02-05 17:08:55,866 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 5258 mSDsluCounter, 13365 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:55,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 17756 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:08:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77620 states. [2025-02-05 17:08:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77620 to 71799. [2025-02-05 17:08:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.6769764612218534) internal successors, (111638), 68633 states have internal predecessors, (111638), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:08:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132806 transitions. [2025-02-05 17:08:58,869 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132806 transitions. Word has length 156 [2025-02-05 17:08:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132806 transitions. [2025-02-05 17:08:58,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:08:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132806 transitions. [2025-02-05 17:08:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:08:58,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:58,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:08:58,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -93411019, now seen corresponding path program 1 times [2025-02-05 17:08:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:58,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26280864] [2025-02-05 17:08:58,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:58,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:08:58,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:08:58,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:58,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26280864] [2025-02-05 17:08:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26280864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472775418] [2025-02-05 17:08:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:58,988 INFO L87 Difference]: Start difference. First operand 71799 states and 132806 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:09:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:02,490 INFO L93 Difference]: Finished difference Result 165538 states and 319858 transitions. [2025-02-05 17:09:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:02,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:09:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:02,897 INFO L225 Difference]: With dead ends: 165538 [2025-02-05 17:09:02,897 INFO L226 Difference]: Without dead ends: 95878 [2025-02-05 17:09:03,073 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-02-05 17:09:03,074 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4654 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 12890 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:03,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 12890 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95878 states. [2025-02-05 17:09:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95878 to 71799. [2025-02-05 17:09:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.675038680506527) internal successors, (111509), 68633 states have internal predecessors, (111509), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:09:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132677 transitions. [2025-02-05 17:09:07,872 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132677 transitions. Word has length 156 [2025-02-05 17:09:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:07,872 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132677 transitions. [2025-02-05 17:09:07,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-05 17:09:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132677 transitions. [2025-02-05 17:09:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:09:07,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:07,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:09:07,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash 337505782, now seen corresponding path program 1 times [2025-02-05 17:09:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823096014] [2025-02-05 17:09:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:09:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:09:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:09:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823096014] [2025-02-05 17:09:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823096014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539990030] [2025-02-05 17:09:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:07,984 INFO L87 Difference]: Start difference. First operand 71799 states and 132677 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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)