./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.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.11.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 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:08:29,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:08:29,791 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:29,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:08:29,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:08:29,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:08:29,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:08:29,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:08:29,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:08:29,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:08:29,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:08:29,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:08:29,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:08:29,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:08:29,823 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:08:29,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:08:29,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:08:29,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:08:29,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:08:29,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:08:29,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:08:29,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:08:29,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:08:29,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:08:29,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:08:29,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:29,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:08:29,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:08:29,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:08:29,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:08:29,827 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 -> 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d [2025-02-05 17:08:30,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:08:30,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:08:30,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:08:30,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:08:30,140 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:08:30,141 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.11.cil-2.c [2025-02-05 17:08:31,529 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81841c768/b73ee8b3a2fd470f9b0ca3f39a779268/FLAGcbe7d6e97 [2025-02-05 17:08:32,309 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:08:32,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2025-02-05 17:08:32,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81841c768/b73ee8b3a2fd470f9b0ca3f39a779268/FLAGcbe7d6e97 [2025-02-05 17:08:32,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81841c768/b73ee8b3a2fd470f9b0ca3f39a779268 [2025-02-05 17:08:32,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:08:32,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:08:32,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:32,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:08:32,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:08:32,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:32" (1/1) ... [2025-02-05 17:08:32,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763b49fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:32, skipping insertion in model container [2025-02-05 17:08:32,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:32" (1/1) ... [2025-02-05 17:08:32,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:08:33,950 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.11.cil-2.c[378560,378573] [2025-02-05 17:08:33,980 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.11.cil-2.c[383339,383352] [2025-02-05 17:08:34,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:34,283 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:08:34,916 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.11.cil-2.c[378560,378573] [2025-02-05 17:08:34,924 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.11.cil-2.c[383339,383352] [2025-02-05 17:08:34,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:35,021 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:08:35,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:35 WrapperNode [2025-02-05 17:08:35,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:35,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:35,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:08:35,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:08:35,027 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:35" (1/1) ... [2025-02-05 17:08:35,112 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:35" (1/1) ... [2025-02-05 17:08:35,564 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-02-05 17:08:35,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:35,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:08:35,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:08:35,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:08:35,575 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:35" (1/1) ... [2025-02-05 17:08:35,575 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:35" (1/1) ... [2025-02-05 17:08:35,681 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:35" (1/1) ... [2025-02-05 17:08:35,753 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:35,753 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:35" (1/1) ... [2025-02-05 17:08:35,753 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:35" (1/1) ... [2025-02-05 17:08:35,928 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:35" (1/1) ... [2025-02-05 17:08:35,952 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:35" (1/1) ... [2025-02-05 17:08:35,983 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:35" (1/1) ... [2025-02-05 17:08:36,008 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:35" (1/1) ... [2025-02-05 17:08:36,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:08:36,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:08:36,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:08:36,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:08:36,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:35" (1/1) ... [2025-02-05 17:08:36,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:36,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:08:36,106 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:36,109 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:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:08:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:08:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:08:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:08:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:08:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:08:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:08:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:08:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:08:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:08:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:08:36,269 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:08:36,271 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:08:44,339 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:08:44,340 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:08:44,340 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:08:44,340 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:08:44,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:08:44,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:08:44,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:08:44,873 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-02-05 17:08:44,874 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:08:44,992 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:08:44,992 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:08:44,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:44 BoogieIcfgContainer [2025-02-05 17:08:45,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:08:45,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:08:45,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:08:45,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:08:45,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:08:32" (1/3) ... [2025-02-05 17:08:45,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6881e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:45, skipping insertion in model container [2025-02-05 17:08:45,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:35" (2/3) ... [2025-02-05 17:08:45,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6881e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:45, skipping insertion in model container [2025-02-05 17:08:45,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:44" (3/3) ... [2025-02-05 17:08:45,030 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-2.c [2025-02-05 17:08:45,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:08:45,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.11.cil-2.c that has 7 procedures, 2564 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-02-05 17:08:45,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:08:45,234 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;@405644b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:08:45,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:08:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:08:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:45,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:45,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:45,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1808491916, now seen corresponding path program 1 times [2025-02-05 17:08:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789053094] [2025-02-05 17:08:45,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:45,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:45,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:45,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:46,003 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,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789053094] [2025-02-05 17:08:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789053094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:46,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182137109] [2025-02-05 17:08:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:46,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:46,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:46,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:46,044 INFO L87 Difference]: Start difference. First operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:47,051 INFO L93 Difference]: Finished difference Result 5513 states and 9981 transitions. [2025-02-05 17:08:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:08:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:47,098 INFO L225 Difference]: With dead ends: 5513 [2025-02-05 17:08:47,099 INFO L226 Difference]: Without dead ends: 2898 [2025-02-05 17:08:47,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:47,116 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 5115 mSDsluCounter, 9229 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 13711 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:47,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 13711 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:08:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-02-05 17:08:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2871. [2025-02-05 17:08:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7876200640341515) internal successors, (5025), 2814 states have internal predecessors, (5025), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:08:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5116 transitions. [2025-02-05 17:08:47,303 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5116 transitions. Word has length 167 [2025-02-05 17:08:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:47,304 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5116 transitions. [2025-02-05 17:08:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5116 transitions. [2025-02-05 17:08:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:47,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:47,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:47,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:08:47,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1308698826, now seen corresponding path program 1 times [2025-02-05 17:08:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170258442] [2025-02-05 17:08:47,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:47,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:47,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:47,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:47,702 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:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170258442] [2025-02-05 17:08:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170258442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748867704] [2025-02-05 17:08:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:47,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:47,709 INFO L87 Difference]: Start difference. First operand 2871 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:48,210 INFO L93 Difference]: Finished difference Result 3674 states and 6383 transitions. [2025-02-05 17:08:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:48,229 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 17:08:48,229 INFO L226 Difference]: Without dead ends: 2943 [2025-02-05 17:08:48,235 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:48,236 INFO L435 NwaCegarLoop]: 4401 mSDtfsCounter, 4736 mSDsluCounter, 8657 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:48,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 13058 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:08:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-02-05 17:08:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2871. [2025-02-05 17:08:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7869085734614016) internal successors, (5023), 2814 states have internal predecessors, (5023), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:08:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5114 transitions. [2025-02-05 17:08:48,343 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5114 transitions. Word has length 167 [2025-02-05 17:08:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:48,345 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5114 transitions. [2025-02-05 17:08:48,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5114 transitions. [2025-02-05 17:08:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:48,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:48,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:08:48,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:48,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1139555051, now seen corresponding path program 1 times [2025-02-05 17:08:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892683756] [2025-02-05 17:08:48,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:48,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:48,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:48,611 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:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892683756] [2025-02-05 17:08:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892683756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:48,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:48,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82325852] [2025-02-05 17:08:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:48,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:48,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:48,616 INFO L87 Difference]: Start difference. First operand 2871 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:49,572 INFO L93 Difference]: Finished difference Result 4069 states and 6993 transitions. [2025-02-05 17:08:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:49,591 INFO L225 Difference]: With dead ends: 4069 [2025-02-05 17:08:49,591 INFO L226 Difference]: Without dead ends: 3338 [2025-02-05 17:08:49,595 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:49,596 INFO L435 NwaCegarLoop]: 4725 mSDtfsCounter, 5048 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:49,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 18972 Invalid, 1047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:08:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-02-05 17:08:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3219. [2025-02-05 17:08:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3132 states have (on average 1.7589399744572158) internal successors, (5509), 3136 states have internal predecessors, (5509), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:08:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5643 transitions. [2025-02-05 17:08:49,800 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5643 transitions. Word has length 167 [2025-02-05 17:08:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:49,800 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5643 transitions. [2025-02-05 17:08:49,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5643 transitions. [2025-02-05 17:08:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:49,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:49,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:08:49,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1221205846, now seen corresponding path program 1 times [2025-02-05 17:08:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187044230] [2025-02-05 17:08:49,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:49,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:49,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:50,036 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:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187044230] [2025-02-05 17:08:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187044230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338883313] [2025-02-05 17:08:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:50,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:50,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:50,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:50,040 INFO L87 Difference]: Start difference. First operand 3219 states and 5643 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:51,056 INFO L93 Difference]: Finished difference Result 5174 states and 8701 transitions. [2025-02-05 17:08:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:51,081 INFO L225 Difference]: With dead ends: 5174 [2025-02-05 17:08:51,081 INFO L226 Difference]: Without dead ends: 4095 [2025-02-05 17:08:51,088 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:51,088 INFO L435 NwaCegarLoop]: 4721 mSDtfsCounter, 5043 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 18956 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:51,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 18956 Invalid, 1047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:08:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-02-05 17:08:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3958. [2025-02-05 17:08:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3815 states have (on average 1.7195281782437746) internal successors, (6560), 3823 states have internal predecessors, (6560), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:08:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6786 transitions. [2025-02-05 17:08:51,249 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6786 transitions. Word has length 167 [2025-02-05 17:08:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:51,250 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6786 transitions. [2025-02-05 17:08:51,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6786 transitions. [2025-02-05 17:08:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:51,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:08:51,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1196492555, now seen corresponding path program 1 times [2025-02-05 17:08:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165201470] [2025-02-05 17:08:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:51,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:51,454 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:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165201470] [2025-02-05 17:08:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165201470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42482049] [2025-02-05 17:08:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:51,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:51,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:51,456 INFO L87 Difference]: Start difference. First operand 3958 states and 6786 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:52,436 INFO L93 Difference]: Finished difference Result 7551 states and 12454 transitions. [2025-02-05 17:08:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:52,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:52,471 INFO L225 Difference]: With dead ends: 7551 [2025-02-05 17:08:52,471 INFO L226 Difference]: Without dead ends: 5733 [2025-02-05 17:08:52,480 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:52,482 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5038 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 18944 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:52,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 18944 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:08:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-02-05 17:08:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5559. [2025-02-05 17:08:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 5298 states have (on average 1.6776141940354852) internal successors, (8888), 5320 states have internal predecessors, (8888), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:08:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9322 transitions. [2025-02-05 17:08:52,716 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9322 transitions. Word has length 167 [2025-02-05 17:08:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:52,717 INFO L471 AbstractCegarLoop]: Abstraction has 5559 states and 9322 transitions. [2025-02-05 17:08:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9322 transitions. [2025-02-05 17:08:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:52,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:52,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:08:52,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1274482826, now seen corresponding path program 1 times [2025-02-05 17:08:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741818519] [2025-02-05 17:08:52,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:52,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:52,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:52,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:52,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:52,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:52,916 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,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741818519] [2025-02-05 17:08:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741818519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:52,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672383515] [2025-02-05 17:08:52,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:52,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:52,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:52,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:52,918 INFO L87 Difference]: Start difference. First operand 5559 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:53,968 INFO L93 Difference]: Finished difference Result 12778 states and 20948 transitions. [2025-02-05 17:08:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:53,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:54,031 INFO L225 Difference]: With dead ends: 12778 [2025-02-05 17:08:54,032 INFO L226 Difference]: Without dead ends: 9359 [2025-02-05 17:08:54,046 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:54,048 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5033 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:54,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 18932 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:08:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-02-05 17:08:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9112. [2025-02-05 17:08:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6503431429568454) internal successors, (14188), 8665 states have internal predecessors, (14188), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:08:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15134 transitions. [2025-02-05 17:08:54,421 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15134 transitions. Word has length 167 [2025-02-05 17:08:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:54,422 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15134 transitions. [2025-02-05 17:08:54,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15134 transitions. [2025-02-05 17:08:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:54,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:54,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:08:54,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1078306005, now seen corresponding path program 1 times [2025-02-05 17:08:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076806985] [2025-02-05 17:08:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:54,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:54,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076806985] [2025-02-05 17:08:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076806985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336854290] [2025-02-05 17:08:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:54,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:54,586 INFO L87 Difference]: Start difference. First operand 9112 states and 15134 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:55,306 INFO L93 Difference]: Finished difference Result 17578 states and 29308 transitions. [2025-02-05 17:08:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:55,367 INFO L225 Difference]: With dead ends: 17578 [2025-02-05 17:08:55,371 INFO L226 Difference]: Without dead ends: 10606 [2025-02-05 17:08:55,406 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:55,407 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4728 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 13020 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:55,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 13020 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:08:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2025-02-05 17:08:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 9112. [2025-02-05 17:08:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6483657089682446) internal successors, (14171), 8665 states have internal predecessors, (14171), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:08:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15117 transitions. [2025-02-05 17:08:56,003 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15117 transitions. Word has length 167 [2025-02-05 17:08:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15117 transitions. [2025-02-05 17:08:56,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15117 transitions. [2025-02-05 17:08:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:56,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:56,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:08:56,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:56,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2137119244, now seen corresponding path program 1 times [2025-02-05 17:08:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268029697] [2025-02-05 17:08:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:56,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:56,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:56,162 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:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268029697] [2025-02-05 17:08:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268029697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482213496] [2025-02-05 17:08:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:56,166 INFO L87 Difference]: Start difference. First operand 9112 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:56,801 INFO L93 Difference]: Finished difference Result 17495 states and 29108 transitions. [2025-02-05 17:08:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:56,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:56,851 INFO L225 Difference]: With dead ends: 17495 [2025-02-05 17:08:56,851 INFO L226 Difference]: Without dead ends: 10523 [2025-02-05 17:08:56,878 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:56,879 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4725 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 13012 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:56,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 13012 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:08:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2025-02-05 17:08:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 9112. [2025-02-05 17:08:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6463882749796441) internal successors, (14154), 8665 states have internal predecessors, (14154), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:08:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15100 transitions. [2025-02-05 17:08:57,419 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15100 transitions. Word has length 167 [2025-02-05 17:08:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:57,420 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15100 transitions. [2025-02-05 17:08:57,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15100 transitions. [2025-02-05 17:08:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:57,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:57,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:57,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:08:57,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:57,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2102295307, now seen corresponding path program 1 times [2025-02-05 17:08:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569403258] [2025-02-05 17:08:57,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:57,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:57,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:57,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:57,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:57,647 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:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569403258] [2025-02-05 17:08:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569403258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965390398] [2025-02-05 17:08:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:57,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:57,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:57,651 INFO L87 Difference]: Start difference. First operand 9112 states and 15100 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:59,008 INFO L93 Difference]: Finished difference Result 24277 states and 40176 transitions. [2025-02-05 17:08:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:59,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:08:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:59,096 INFO L225 Difference]: With dead ends: 24277 [2025-02-05 17:08:59,097 INFO L226 Difference]: Without dead ends: 17305 [2025-02-05 17:08:59,130 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:59,131 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5009 mSDsluCounter, 14170 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 18868 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:59,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 18868 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:08:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2025-02-05 17:08:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16974. [2025-02-05 17:08:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6395546329496131) internal successors, (26064), 16111 states have internal predecessors, (26064), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:08:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28418 transitions. [2025-02-05 17:08:59,806 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28418 transitions. Word has length 167 [2025-02-05 17:08:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:59,807 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28418 transitions. [2025-02-05 17:08:59,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28418 transitions. [2025-02-05 17:08:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:08:59,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:59,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:08:59,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 254132692, now seen corresponding path program 1 times [2025-02-05 17:08:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420112198] [2025-02-05 17:08:59,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:08:59,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:08:59,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:59,972 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:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420112198] [2025-02-05 17:08:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420112198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436345281] [2025-02-05 17:08:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:59,974 INFO L87 Difference]: Start difference. First operand 16974 states and 28418 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:00,927 INFO L93 Difference]: Finished difference Result 35483 states and 60552 transitions. [2025-02-05 17:09:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:01,040 INFO L225 Difference]: With dead ends: 35483 [2025-02-05 17:09:01,041 INFO L226 Difference]: Without dead ends: 20649 [2025-02-05 17:09:01,093 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:01,095 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4721 mSDsluCounter, 8618 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 12998 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:01,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 12998 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2025-02-05 17:09:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 16974. [2025-02-05 17:09:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.637478769579166) internal successors, (26031), 16111 states have internal predecessors, (26031), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:09:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28385 transitions. [2025-02-05 17:09:01,893 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28385 transitions. Word has length 167 [2025-02-05 17:09:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:01,895 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28385 transitions. [2025-02-05 17:09:01,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28385 transitions. [2025-02-05 17:09:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:01,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:01,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:01,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:09:01,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1193874155, now seen corresponding path program 1 times [2025-02-05 17:09:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869470036] [2025-02-05 17:09:01,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:01,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:02,039 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:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869470036] [2025-02-05 17:09:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869470036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271562955] [2025-02-05 17:09:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:02,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:02,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:02,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:02,042 INFO L87 Difference]: Start difference. First operand 16974 states and 28385 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:03,548 INFO L93 Difference]: Finished difference Result 35238 states and 59996 transitions. [2025-02-05 17:09:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:03,665 INFO L225 Difference]: With dead ends: 35238 [2025-02-05 17:09:03,665 INFO L226 Difference]: Without dead ends: 20404 [2025-02-05 17:09:03,704 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,707 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4718 mSDsluCounter, 8613 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12990 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:03,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12990 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2025-02-05 17:09:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 16974. [2025-02-05 17:09:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6354029062087185) internal successors, (25998), 16111 states have internal predecessors, (25998), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:09:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28352 transitions. [2025-02-05 17:09:04,445 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28352 transitions. Word has length 167 [2025-02-05 17:09:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:04,447 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28352 transitions. [2025-02-05 17:09:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28352 transitions. [2025-02-05 17:09:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:04,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:04,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:09:04,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:04,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash 144889268, now seen corresponding path program 1 times [2025-02-05 17:09:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567537713] [2025-02-05 17:09:04,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:04,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:04,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:04,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:04,612 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:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567537713] [2025-02-05 17:09:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567537713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:04,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811172905] [2025-02-05 17:09:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:04,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:04,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:04,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:04,616 INFO L87 Difference]: Start difference. First operand 16974 states and 28352 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:06,533 INFO L93 Difference]: Finished difference Result 52501 states and 89027 transitions. [2025-02-05 17:09:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:06,709 INFO L225 Difference]: With dead ends: 52501 [2025-02-05 17:09:06,710 INFO L226 Difference]: Without dead ends: 37667 [2025-02-05 17:09:06,751 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:09:06,753 INFO L435 NwaCegarLoop]: 4683 mSDtfsCounter, 5332 mSDsluCounter, 14122 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 18805 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:06,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 18805 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:09:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37667 states. [2025-02-05 17:09:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37667 to 34465. [2025-02-05 17:09:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6466670815958175) internal successors, (52914), 32802 states have internal predecessors, (52914), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:09:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59556 transitions. [2025-02-05 17:09:08,627 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59556 transitions. Word has length 167 [2025-02-05 17:09:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59556 transitions. [2025-02-05 17:09:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59556 transitions. [2025-02-05 17:09:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:08,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:08,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:08,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:09:08,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:08,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash 326622517, now seen corresponding path program 1 times [2025-02-05 17:09:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089786063] [2025-02-05 17:09:08,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:08,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:08,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:08,804 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:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089786063] [2025-02-05 17:09:08,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089786063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:08,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:08,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447802303] [2025-02-05 17:09:08,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:08,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:08,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:08,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:08,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:08,808 INFO L87 Difference]: Start difference. First operand 34465 states and 59556 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:10,761 INFO L93 Difference]: Finished difference Result 75562 states and 134700 transitions. [2025-02-05 17:09:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:10,973 INFO L225 Difference]: With dead ends: 75562 [2025-02-05 17:09:10,973 INFO L226 Difference]: Without dead ends: 43237 [2025-02-05 17:09:11,054 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:11,056 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4712 mSDsluCounter, 8602 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12974 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:11,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12974 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43237 states. [2025-02-05 17:09:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43237 to 34465. [2025-02-05 17:09:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.644644301985436) internal successors, (52849), 32802 states have internal predecessors, (52849), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:09:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59491 transitions. [2025-02-05 17:09:12,987 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59491 transitions. Word has length 167 [2025-02-05 17:09:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59491 transitions. [2025-02-05 17:09:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59491 transitions. [2025-02-05 17:09:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:13,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:09:13,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 471032212, now seen corresponding path program 1 times [2025-02-05 17:09:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124370505] [2025-02-05 17:09:13,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:13,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:13,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:13,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:13,108 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:13,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124370505] [2025-02-05 17:09:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124370505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:13,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508103697] [2025-02-05 17:09:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:13,111 INFO L87 Difference]: Start difference. First operand 34465 states and 59491 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:15,231 INFO L93 Difference]: Finished difference Result 74100 states and 131646 transitions. [2025-02-05 17:09:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:15,440 INFO L225 Difference]: With dead ends: 74100 [2025-02-05 17:09:15,440 INFO L226 Difference]: Without dead ends: 41775 [2025-02-05 17:09:15,543 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:15,544 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4708 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:15,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12960 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2025-02-05 17:09:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 34465. [2025-02-05 17:09:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6426215223750544) internal successors, (52784), 32802 states have internal predecessors, (52784), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:09:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59426 transitions. [2025-02-05 17:09:17,745 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59426 transitions. Word has length 167 [2025-02-05 17:09:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59426 transitions. [2025-02-05 17:09:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59426 transitions. [2025-02-05 17:09:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:17,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:17,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:09:17,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1338871373, now seen corresponding path program 1 times [2025-02-05 17:09:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270692158] [2025-02-05 17:09:17,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:17,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:17,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:17,853 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:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270692158] [2025-02-05 17:09:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270692158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:17,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:17,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034733959] [2025-02-05 17:09:17,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:17,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:17,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:17,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:17,856 INFO L87 Difference]: Start difference. First operand 34465 states and 59426 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:19,521 INFO L93 Difference]: Finished difference Result 73369 states and 130054 transitions. [2025-02-05 17:09:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:19,699 INFO L225 Difference]: With dead ends: 73369 [2025-02-05 17:09:19,699 INFO L226 Difference]: Without dead ends: 41044 [2025-02-05 17:09:19,777 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:19,777 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4705 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12952 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:19,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12952 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41044 states. [2025-02-05 17:09:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41044 to 34465. [2025-02-05 17:09:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6405987427646729) internal successors, (52719), 32802 states have internal predecessors, (52719), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:09:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59361 transitions. [2025-02-05 17:09:21,487 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59361 transitions. Word has length 167 [2025-02-05 17:09:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:21,487 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59361 transitions. [2025-02-05 17:09:21,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59361 transitions. [2025-02-05 17:09:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:21,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:21,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:09:21,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1812897356, now seen corresponding path program 1 times [2025-02-05 17:09:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218513717] [2025-02-05 17:09:21,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:21,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:21,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:21,655 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:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218513717] [2025-02-05 17:09:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218513717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:21,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975935560] [2025-02-05 17:09:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:21,657 INFO L87 Difference]: Start difference. First operand 34465 states and 59361 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:25,011 INFO L93 Difference]: Finished difference Result 108112 states and 193016 transitions. [2025-02-05 17:09:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:25,320 INFO L225 Difference]: With dead ends: 108112 [2025-02-05 17:09:25,320 INFO L226 Difference]: Without dead ends: 75787 [2025-02-05 17:09:25,400 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:09:25,401 INFO L435 NwaCegarLoop]: 4661 mSDtfsCounter, 5150 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:25,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 18722 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:09:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2025-02-05 17:09:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 72024. [2025-02-05 17:09:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72024 states, 66731 states have (on average 1.6506721014221277) internal successors, (110151), 68793 states have internal predecessors, (110151), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-02-05 17:09:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72024 states to 72024 states and 131449 transitions. [2025-02-05 17:09:29,142 INFO L78 Accepts]: Start accepts. Automaton has 72024 states and 131449 transitions. Word has length 167 [2025-02-05 17:09:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:29,143 INFO L471 AbstractCegarLoop]: Abstraction has 72024 states and 131449 transitions. [2025-02-05 17:09:29,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 72024 states and 131449 transitions. [2025-02-05 17:09:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:09:29,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:29,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:09:29,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2105283181, now seen corresponding path program 1 times [2025-02-05 17:09:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65643661] [2025-02-05 17:09:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:09:29,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:09:29,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:29,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:29,258 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:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65643661] [2025-02-05 17:09:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65643661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492891876] [2025-02-05 17:09:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:29,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:29,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:29,261 INFO L87 Difference]: Start difference. First operand 72024 states and 131449 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:32,781 INFO L93 Difference]: Finished difference Result 157231 states and 299630 transitions. [2025-02-05 17:09:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:09:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:33,123 INFO L225 Difference]: With dead ends: 157231 [2025-02-05 17:09:33,124 INFO L226 Difference]: Without dead ends: 87347 [2025-02-05 17:09:33,481 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:33,481 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4701 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:33,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 12938 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87347 states.