./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:10:30,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:10:30,989 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:10:30,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:10:30,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:10:31,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:10:31,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:10:31,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:10:31,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:10:31,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:10:31,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:10:31,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:10:31,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:10:31,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:10:31,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:10:31,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:10:31,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:10:31,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:31,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:10:31,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:10:31,021 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 -> 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d [2025-02-05 17:10:31,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:10:31,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:10:31,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:10:31,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:10:31,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:10:31,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2025-02-05 17:10:32,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b53321ff/94c8b0dd47ec4708a43a46f2497c5a42/FLAGc1b54395e [2025-02-05 17:10:33,068 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:10:33,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2025-02-05 17:10:33,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b53321ff/94c8b0dd47ec4708a43a46f2497c5a42/FLAGc1b54395e [2025-02-05 17:10:33,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b53321ff/94c8b0dd47ec4708a43a46f2497c5a42 [2025-02-05 17:10:33,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:10:33,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:10:33,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:33,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:10:33,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:10:33,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:33" (1/1) ... [2025-02-05 17:10:33,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2107ef4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:33, skipping insertion in model container [2025-02-05 17:10:33,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:33" (1/1) ... [2025-02-05 17:10:33,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:10:34,732 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_label43+token_ring.10.cil-2.c[381679,381692] [2025-02-05 17:10:34,759 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_label43+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:10:34,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:34,979 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:10:35,481 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_label43+token_ring.10.cil-2.c[381679,381692] [2025-02-05 17:10:35,485 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_label43+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:10:35,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:35,550 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:10:35,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35 WrapperNode [2025-02-05 17:10:35,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:35,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:35,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:10:35,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:10:35,557 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:10:35" (1/1) ... [2025-02-05 17:10:35,617 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:10:35" (1/1) ... [2025-02-05 17:10:35,888 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-02-05 17:10:35,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:35,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:10:35,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:10:35,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:10:35,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:35,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:35,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,101 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:10:36,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:10:36,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:10:36,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:10:36,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:10:36,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (1/1) ... [2025-02-05 17:10:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:10:36,330 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:10:36,334 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:10:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:10:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:10:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:10:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:10:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:10:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:10:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:10:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:10:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:10:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:10:36,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:10:36,461 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:10:36,463 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:10:42,540 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:10:42,541 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:10:42,541 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:10:42,541 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:10:42,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:10:42,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:10:42,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:10:42,767 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-02-05 17:10:42,767 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:10:42,817 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:10:42,817 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:10:42,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:42 BoogieIcfgContainer [2025-02-05 17:10:42,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:10:42,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:10:42,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:10:42,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:10:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:10:33" (1/3) ... [2025-02-05 17:10:42,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2484c6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:42, skipping insertion in model container [2025-02-05 17:10:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:35" (2/3) ... [2025-02-05 17:10:42,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2484c6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:42, skipping insertion in model container [2025-02-05 17:10:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:42" (3/3) ... [2025-02-05 17:10:42,827 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.10.cil-2.c [2025-02-05 17:10:42,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:10:42,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.10.cil-2.c that has 7 procedures, 2537 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:10:42,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:10:42,949 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;@15d4fe97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:10:42,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:10:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 17:10:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:42,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:42,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:42,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 490995444, now seen corresponding path program 1 times [2025-02-05 17:10:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468722020] [2025-02-05 17:10:42,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:43,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:43,483 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:10:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468722020] [2025-02-05 17:10:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468722020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919611319] [2025-02-05 17:10:43,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:43,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:43,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:43,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:43,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:43,511 INFO L87 Difference]: Start difference. First operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:44,222 INFO L93 Difference]: Finished difference Result 5430 states and 9845 transitions. [2025-02-05 17:10:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:10:44,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:44,249 INFO L225 Difference]: With dead ends: 5430 [2025-02-05 17:10:44,250 INFO L226 Difference]: Without dead ends: 2841 [2025-02-05 17:10:44,257 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:10:44,261 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5028 mSDsluCounter, 9139 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 13587 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 13587 Invalid, 602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:10:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-02-05 17:10:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2816. [2025-02-05 17:10:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7915155910079767) internal successors, (4941), 2761 states have internal predecessors, (4941), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:10:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5028 transitions. [2025-02-05 17:10:44,408 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5028 transitions. Word has length 156 [2025-02-05 17:10:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:44,409 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5028 transitions. [2025-02-05 17:10:44,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5028 transitions. [2025-02-05 17:10:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:44,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:44,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:44,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:44,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1402295606, now seen corresponding path program 1 times [2025-02-05 17:10:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682051090] [2025-02-05 17:10:44,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:44,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:44,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:44,590 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:10:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682051090] [2025-02-05 17:10:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682051090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655362308] [2025-02-05 17:10:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:44,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:44,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:44,592 INFO L87 Difference]: Start difference. First operand 2816 states and 5028 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:44,906 INFO L93 Difference]: Finished difference Result 3559 states and 6197 transitions. [2025-02-05 17:10:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:44,917 INFO L225 Difference]: With dead ends: 3559 [2025-02-05 17:10:44,918 INFO L226 Difference]: Without dead ends: 2882 [2025-02-05 17:10:44,921 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:10:44,921 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4675 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 12966 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:44,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 12966 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-02-05 17:10:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2816. [2025-02-05 17:10:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7907904278462654) internal successors, (4939), 2761 states have internal predecessors, (4939), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:10:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5026 transitions. [2025-02-05 17:10:44,992 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5026 transitions. Word has length 156 [2025-02-05 17:10:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:44,993 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5026 transitions. [2025-02-05 17:10:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5026 transitions. [2025-02-05 17:10:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:44,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:44,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:44,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:44,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:44,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1553908267, now seen corresponding path program 1 times [2025-02-05 17:10:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211997529] [2025-02-05 17:10:45,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:45,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:45,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:45,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:45,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211997529] [2025-02-05 17:10:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211997529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:45,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:45,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185679317] [2025-02-05 17:10:45,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:45,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:45,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:45,169 INFO L87 Difference]: Start difference. First operand 2816 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:45,835 INFO L93 Difference]: Finished difference Result 3924 states and 6758 transitions. [2025-02-05 17:10:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:45,850 INFO L225 Difference]: With dead ends: 3924 [2025-02-05 17:10:45,850 INFO L226 Difference]: Without dead ends: 3247 [2025-02-05 17:10:45,854 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:10:45,855 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 4959 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 18725 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:45,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 18725 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:10:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-02-05 17:10:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3138. [2025-02-05 17:10:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3054 states have (on average 1.7635887360838245) internal successors, (5386), 3058 states have internal predecessors, (5386), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:10:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5514 transitions. [2025-02-05 17:10:45,933 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5514 transitions. Word has length 156 [2025-02-05 17:10:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5514 transitions. [2025-02-05 17:10:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5514 transitions. [2025-02-05 17:10:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:45,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:45,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:45,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:45,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:45,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1372175018, now seen corresponding path program 1 times [2025-02-05 17:10:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299855731] [2025-02-05 17:10:45,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:45,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:45,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:45,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:45,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:46,067 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:10:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299855731] [2025-02-05 17:10:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299855731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:46,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557563378] [2025-02-05 17:10:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:46,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:46,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:46,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:46,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:46,069 INFO L87 Difference]: Start difference. First operand 3138 states and 5514 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:46,785 INFO L93 Difference]: Finished difference Result 4945 states and 8331 transitions. [2025-02-05 17:10:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:46,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:46,801 INFO L225 Difference]: With dead ends: 4945 [2025-02-05 17:10:46,801 INFO L226 Difference]: Without dead ends: 3946 [2025-02-05 17:10:46,805 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:10:46,806 INFO L435 NwaCegarLoop]: 4409 mSDtfsCounter, 4982 mSDsluCounter, 13431 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:46,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5000 Valid, 17840 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:10:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-02-05 17:10:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3821. [2025-02-05 17:10:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3683 states have (on average 1.7244094488188977) internal successors, (6351), 3691 states have internal predecessors, (6351), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-02-05 17:10:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6567 transitions. [2025-02-05 17:10:46,945 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6567 transitions. Word has length 156 [2025-02-05 17:10:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6567 transitions. [2025-02-05 17:10:46,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6567 transitions. [2025-02-05 17:10:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:46,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:46,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:46,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:46,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:46,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1227765323, now seen corresponding path program 1 times [2025-02-05 17:10:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112270571] [2025-02-05 17:10:46,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:46,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:46,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:46,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:46,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:47,116 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:10:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:47,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112270571] [2025-02-05 17:10:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112270571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430815413] [2025-02-05 17:10:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:47,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:47,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:47,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:47,118 INFO L87 Difference]: Start difference. First operand 3821 states and 6567 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:47,829 INFO L93 Difference]: Finished difference Result 7138 states and 11782 transitions. [2025-02-05 17:10:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:47,848 INFO L225 Difference]: With dead ends: 7138 [2025-02-05 17:10:47,848 INFO L226 Difference]: Without dead ends: 5456 [2025-02-05 17:10:47,853 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:10:47,854 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 4949 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4967 SdHoareTripleChecker+Valid, 18697 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:47,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4967 Valid, 18697 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:10:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-02-05 17:10:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5298. [2025-02-05 17:10:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5046 states have (on average 1.6811335711454618) internal successors, (8483), 5068 states have internal predecessors, (8483), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-02-05 17:10:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 8899 transitions. [2025-02-05 17:10:47,996 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 8899 transitions. Word has length 156 [2025-02-05 17:10:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:47,997 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 8899 transitions. [2025-02-05 17:10:47,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 8899 transitions. [2025-02-05 17:10:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:48,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:48,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] [2025-02-05 17:10:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:48,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:48,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1500201610, now seen corresponding path program 1 times [2025-02-05 17:10:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506597528] [2025-02-05 17:10:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:48,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:48,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:48,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:48,132 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:10:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506597528] [2025-02-05 17:10:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506597528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017549784] [2025-02-05 17:10:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:48,135 INFO L87 Difference]: Start difference. First operand 5298 states and 8899 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:48,862 INFO L93 Difference]: Finished difference Result 11949 states and 19576 transitions. [2025-02-05 17:10:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:48,901 INFO L225 Difference]: With dead ends: 11949 [2025-02-05 17:10:48,901 INFO L226 Difference]: Without dead ends: 8790 [2025-02-05 17:10:48,908 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:10:48,909 INFO L435 NwaCegarLoop]: 4656 mSDtfsCounter, 4944 mSDsluCounter, 14029 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4962 SdHoareTripleChecker+Valid, 18685 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:48,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4962 Valid, 18685 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:10:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2025-02-05 17:10:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8567. [2025-02-05 17:10:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8567 states, 8069 states have (on average 1.6506382451357045) internal successors, (13319), 8137 states have internal predecessors, (13319), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:10:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 14231 transitions. [2025-02-05 17:10:49,115 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 14231 transitions. Word has length 156 [2025-02-05 17:10:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:49,115 INFO L471 AbstractCegarLoop]: Abstraction has 8567 states and 14231 transitions. [2025-02-05 17:10:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 14231 transitions. [2025-02-05 17:10:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:49,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:49,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:49,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:49,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 984862101, now seen corresponding path program 1 times [2025-02-05 17:10:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617862486] [2025-02-05 17:10:49,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:49,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:49,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:49,239 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:10:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617862486] [2025-02-05 17:10:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617862486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367739116] [2025-02-05 17:10:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:49,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:49,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:49,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:49,241 INFO L87 Difference]: Start difference. First operand 8567 states and 14231 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:49,989 INFO L93 Difference]: Finished difference Result 22772 states and 37818 transitions. [2025-02-05 17:10:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:49,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:50,059 INFO L225 Difference]: With dead ends: 22772 [2025-02-05 17:10:50,060 INFO L226 Difference]: Without dead ends: 16344 [2025-02-05 17:10:50,085 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:10:50,086 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 4939 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4957 SdHoareTripleChecker+Valid, 18673 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:50,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4957 Valid, 18673 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:10:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2025-02-05 17:10:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 15996. [2025-02-05 17:10:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6454654895666132) internal successors, (24603), 15166 states have internal predecessors, (24603), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:10:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26891 transitions. [2025-02-05 17:10:50,581 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26891 transitions. Word has length 156 [2025-02-05 17:10:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:50,582 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26891 transitions. [2025-02-05 17:10:50,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26891 transitions. [2025-02-05 17:10:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:50,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:50,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:50,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash 510836118, now seen corresponding path program 1 times [2025-02-05 17:10:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743538272] [2025-02-05 17:10:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:50,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:50,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:50,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:50,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:50,697 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:10:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743538272] [2025-02-05 17:10:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743538272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:50,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:50,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708192578] [2025-02-05 17:10:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:50,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:50,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:50,700 INFO L87 Difference]: Start difference. First operand 15996 states and 26891 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:51,327 INFO L93 Difference]: Finished difference Result 33773 states and 57990 transitions. [2025-02-05 17:10:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:51,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:51,387 INFO L225 Difference]: With dead ends: 33773 [2025-02-05 17:10:51,387 INFO L226 Difference]: Without dead ends: 19916 [2025-02-05 17:10:51,415 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:10:51,416 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4667 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12928 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:51,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 12928 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2025-02-05 17:10:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 15996. [2025-02-05 17:10:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6432584269662922) internal successors, (24570), 15166 states have internal predecessors, (24570), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:10:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26858 transitions. [2025-02-05 17:10:51,847 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26858 transitions. Word has length 156 [2025-02-05 17:10:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26858 transitions. [2025-02-05 17:10:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26858 transitions. [2025-02-05 17:10:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:51,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:51,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:10:51,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 218450293, now seen corresponding path program 1 times [2025-02-05 17:10:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871112910] [2025-02-05 17:10:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:51,951 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:10:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871112910] [2025-02-05 17:10:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871112910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:51,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743648963] [2025-02-05 17:10:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:51,953 INFO L87 Difference]: Start difference. First operand 15996 states and 26858 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:52,842 INFO L93 Difference]: Finished difference Result 33528 states and 57434 transitions. [2025-02-05 17:10:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:52,918 INFO L225 Difference]: With dead ends: 33528 [2025-02-05 17:10:52,919 INFO L226 Difference]: Without dead ends: 19671 [2025-02-05 17:10:52,959 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:10:52,960 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4664 mSDsluCounter, 8569 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:52,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 12920 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-02-05 17:10:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 15996. [2025-02-05 17:10:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6410513643659712) internal successors, (24537), 15166 states have internal predecessors, (24537), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:10:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26825 transitions. [2025-02-05 17:10:53,417 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26825 transitions. Word has length 156 [2025-02-05 17:10:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:53,418 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26825 transitions. [2025-02-05 17:10:53,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26825 transitions. [2025-02-05 17:10:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:53,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:10:53,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2146286154, now seen corresponding path program 1 times [2025-02-05 17:10:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431268840] [2025-02-05 17:10:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:53,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:53,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:53,523 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:10:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431268840] [2025-02-05 17:10:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431268840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880576815] [2025-02-05 17:10:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:53,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:53,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:53,524 INFO L87 Difference]: Start difference. First operand 15996 states and 26825 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:54,601 INFO L93 Difference]: Finished difference Result 47251 states and 81018 transitions. [2025-02-05 17:10:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:54,722 INFO L225 Difference]: With dead ends: 47251 [2025-02-05 17:10:54,722 INFO L226 Difference]: Without dead ends: 33394 [2025-02-05 17:10:54,765 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:10:54,765 INFO L435 NwaCegarLoop]: 4640 mSDtfsCounter, 4918 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18623 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:54,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18623 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:10:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33394 states. [2025-02-05 17:10:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33394 to 32879. [2025-02-05 17:10:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.6542624505411858) internal successors, (50589), 31249 states have internal predecessors, (50589), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:10:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57165 transitions. [2025-02-05 17:10:55,690 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57165 transitions. Word has length 156 [2025-02-05 17:10:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57165 transitions. [2025-02-05 17:10:55,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57165 transitions. [2025-02-05 17:10:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:55,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:10:55,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1933851989, now seen corresponding path program 1 times [2025-02-05 17:10:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210223355] [2025-02-05 17:10:55,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:55,782 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:10:55,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:55,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210223355] [2025-02-05 17:10:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210223355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706609388] [2025-02-05 17:10:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:55,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:55,784 INFO L87 Difference]: Start difference. First operand 32879 states and 57165 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:57,200 INFO L93 Difference]: Finished difference Result 73122 states and 131382 transitions. [2025-02-05 17:10:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:10:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:57,362 INFO L225 Difference]: With dead ends: 73122 [2025-02-05 17:10:57,362 INFO L226 Difference]: Without dead ends: 42382 [2025-02-05 17:10:57,441 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:10:57,441 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4660 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 12906 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:57,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 12906 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2025-02-05 17:10:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 32879. [2025-02-05 17:10:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.652136947778032) internal successors, (50524), 31249 states have internal predecessors, (50524), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:10:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57100 transitions. [2025-02-05 17:10:59,247 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57100 transitions. Word has length 156 [2025-02-05 17:10:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:59,248 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57100 transitions. [2025-02-05 17:10:59,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57100 transitions. [2025-02-05 17:10:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:10:59,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:59,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:59,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:10:59,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:59,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash -566929962, now seen corresponding path program 1 times [2025-02-05 17:10:59,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:59,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834735025] [2025-02-05 17:10:59,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:59,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:59,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:10:59,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:10:59,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:59,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:59,347 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:10:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:59,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834735025] [2025-02-05 17:10:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834735025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551339729] [2025-02-05 17:10:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:59,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:59,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:59,349 INFO L87 Difference]: Start difference. First operand 32879 states and 57100 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:01,328 INFO L93 Difference]: Finished difference Result 108360 states and 195178 transitions. [2025-02-05 17:11:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:11:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:01,654 INFO L225 Difference]: With dead ends: 108360 [2025-02-05 17:11:01,654 INFO L226 Difference]: Without dead ends: 77620 [2025-02-05 17:11:01,883 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:11:01,884 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 5258 mSDsluCounter, 13365 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:01,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 17756 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77620 states. [2025-02-05 17:11:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77620 to 71799. [2025-02-05 17:11:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.6769764612218534) internal successors, (111638), 68633 states have internal predecessors, (111638), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:11:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132806 transitions. [2025-02-05 17:11:04,912 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132806 transitions. Word has length 156 [2025-02-05 17:11:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132806 transitions. [2025-02-05 17:11:04,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132806 transitions. [2025-02-05 17:11:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:11:04,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:04,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:04,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:11:04,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:04,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash -93411019, now seen corresponding path program 1 times [2025-02-05 17:11:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:04,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697473735] [2025-02-05 17:11:04,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:04,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:11:04,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:11:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:05,008 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:11:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697473735] [2025-02-05 17:11:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697473735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996141442] [2025-02-05 17:11:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:05,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:05,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:05,011 INFO L87 Difference]: Start difference. First operand 71799 states and 132806 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:08,223 INFO L93 Difference]: Finished difference Result 165538 states and 319858 transitions. [2025-02-05 17:11:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:11:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:08,638 INFO L225 Difference]: With dead ends: 165538 [2025-02-05 17:11:08,639 INFO L226 Difference]: Without dead ends: 95878 [2025-02-05 17:11:09,004 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:11:09,009 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4654 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 12890 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:09,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 12890 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:11:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95878 states. [2025-02-05 17:11:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95878 to 71799. [2025-02-05 17:11:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.675038680506527) internal successors, (111509), 68633 states have internal predecessors, (111509), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:11:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132677 transitions. [2025-02-05 17:11:13,202 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132677 transitions. Word has length 156 [2025-02-05 17:11:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132677 transitions. [2025-02-05 17:11:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132677 transitions. [2025-02-05 17:11:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:11:13,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:13,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:13,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:11:13,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 337505782, now seen corresponding path program 1 times [2025-02-05 17:11:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594833759] [2025-02-05 17:11:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:13,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:11:13,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:11:13,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:13,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:13,343 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:11:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594833759] [2025-02-05 17:11:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594833759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710188713] [2025-02-05 17:11:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:13,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:13,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:13,344 INFO L87 Difference]: Start difference. First operand 71799 states and 132677 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:18,905 INFO L93 Difference]: Finished difference Result 241756 states and 474039 transitions. [2025-02-05 17:11:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-02-05 17:11:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:20,003 INFO L225 Difference]: With dead ends: 241756 [2025-02-05 17:11:20,003 INFO L226 Difference]: Without dead ends: 172096 [2025-02-05 17:11:20,161 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:11:20,161 INFO L435 NwaCegarLoop]: 4622 mSDtfsCounter, 5146 mSDsluCounter, 13926 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5175 SdHoareTripleChecker+Valid, 18548 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:20,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5175 Valid, 18548 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:11:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172096 states. [2025-02-05 17:11:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172096 to 162569. [2025-02-05 17:11:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162569 states, 150087 states have (on average 1.7009267957917742) internal successors, (255287), 156395 states have internal predecessors, (255287), 4632 states have call successors, (4632), 1542 states have call predecessors, (4632), 7848 states have return successors, (70168), 4887 states have call predecessors, (70168), 4632 states have call successors, (70168) [2025-02-05 17:11:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162569 states to 162569 states and 330087 transitions. [2025-02-05 17:11:28,905 INFO L78 Accepts]: Start accepts. Automaton has 162569 states and 330087 transitions. Word has length 156 [2025-02-05 17:11:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:28,905 INFO L471 AbstractCegarLoop]: Abstraction has 162569 states and 330087 transitions. [2025-02-05 17:11:28,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:11:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 162569 states and 330087 transitions. [2025-02-05 17:11:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:11:28,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:28,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:28,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:11:28,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1459784981, now seen corresponding path program 1 times [2025-02-05 17:11:28,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138008208] [2025-02-05 17:11:28,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:11:28,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:11:28,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:28,996 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:11:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138008208] [2025-02-05 17:11:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138008208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257878581] [2025-02-05 17:11:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:28,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:28,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:28,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:28,998 INFO L87 Difference]: Start difference. First operand 162569 states and 330087 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)