./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.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_label46+token_ring.05.cil-1.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 5ee0afe9c2a2e5e350a29156a4a7c18a224cec42ab7ff37fc9f10d35d9e173ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:14:43,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:14:43,935 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:14:43,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:14:43,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:14:43,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:14:43,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:14:43,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:14:43,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:14:43,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:14:43,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:14:43,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:14:43,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:14:43,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:14:43,974 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:14:43,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:14:43,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:14:43,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:14:43,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:14:43,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:14:43,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:14:43,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:14:43,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:14:43,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:14:43,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:14:43,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:14:43,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:14:43,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:14:43,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:14:43,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:14:43,978 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 -> 5ee0afe9c2a2e5e350a29156a4a7c18a224cec42ab7ff37fc9f10d35d9e173ae [2025-02-05 17:14:44,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:14:44,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:14:44,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:14:44,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:14:44,264 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:14:44,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c [2025-02-05 17:14:45,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c6ec3bd/85874d99e241487a874323883f0895c5/FLAG2e636e622 [2025-02-05 17:14:46,247 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:14:46,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c [2025-02-05 17:14:46,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c6ec3bd/85874d99e241487a874323883f0895c5/FLAG2e636e622 [2025-02-05 17:14:46,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c6ec3bd/85874d99e241487a874323883f0895c5 [2025-02-05 17:14:46,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:14:46,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:14:46,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:14:46,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:14:46,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:14:46,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:14:46" (1/1) ... [2025-02-05 17:14:46,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ce3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:46, skipping insertion in model container [2025-02-05 17:14:46,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:14:46" (1/1) ... [2025-02-05 17:14:46,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:14:47,820 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_label46+token_ring.05.cil-1.c[382357,382370] [2025-02-05 17:14:47,856 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_label46+token_ring.05.cil-1.c[383339,383352] [2025-02-05 17:14:48,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:14:48,121 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:14:48,781 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_label46+token_ring.05.cil-1.c[382357,382370] [2025-02-05 17:14:48,786 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_label46+token_ring.05.cil-1.c[383339,383352] [2025-02-05 17:14:48,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:14:48,873 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:14:48,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48 WrapperNode [2025-02-05 17:14:48,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:14:48,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:14:48,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:14:48,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:14:48,884 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:14:48" (1/1) ... [2025-02-05 17:14:48,974 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:14:48" (1/1) ... [2025-02-05 17:14:49,318 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-02-05 17:14:49,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:14:49,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:14:49,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:14:49,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:14:49,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,517 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:14:49,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:14:49,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:14:49,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:14:49,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:14:49,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (1/1) ... [2025-02-05 17:14:49,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:14:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:14:49,990 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:14:49,998 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:14:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:14:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:14:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:14:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:14:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:14:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:14:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:14:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:14:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:14:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:14:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:14:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:14:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:14:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:14:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:14:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:14:50,126 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:14:50,128 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:14:58,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:14:58,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:14:58,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:14:58,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:14:58,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:14:58,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:14:58,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:14:59,163 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-02-05 17:14:59,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:14:59,307 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:14:59,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:14:59,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:14:59 BoogieIcfgContainer [2025-02-05 17:14:59,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:14:59,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:14:59,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:14:59,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:14:59,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:14:46" (1/3) ... [2025-02-05 17:14:59,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e880803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:14:59, skipping insertion in model container [2025-02-05 17:14:59,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:14:48" (2/3) ... [2025-02-05 17:14:59,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e880803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:14:59, skipping insertion in model container [2025-02-05 17:14:59,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:14:59" (3/3) ... [2025-02-05 17:14:59,318 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.05.cil-1.c [2025-02-05 17:14:59,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:14:59,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.05.cil-1.c that has 7 procedures, 2402 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-02-05 17:14:59,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:14:59,502 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;@8e48da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:14:59,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:14:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 17:14:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:14:59,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:14:59,536 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] [2025-02-05 17:14:59,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:14:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:14:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1126425006, now seen corresponding path program 1 times [2025-02-05 17:14:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:14:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432160354] [2025-02-05 17:14:59,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:14:59,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:14:59,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:14:59,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:14:59,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:14:59,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:00,112 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:15:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432160354] [2025-02-05 17:15:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432160354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400827114] [2025-02-05 17:15:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:00,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:00,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:00,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:00,152 INFO L87 Difference]: Start difference. First operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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:15:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:00,868 INFO L93 Difference]: Finished difference Result 5015 states and 9165 transitions. [2025-02-05 17:15:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:15:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:00,903 INFO L225 Difference]: With dead ends: 5015 [2025-02-05 17:15:00,903 INFO L226 Difference]: Without dead ends: 2556 [2025-02-05 17:15:00,915 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:15:00,918 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4593 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 12967 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:00,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 12967 Invalid, 387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-02-05 17:15:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2541. [2025-02-05 17:15:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8134777376654634) internal successors, (4521), 2496 states have internal predecessors, (4521), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-02-05 17:15:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4588 transitions. [2025-02-05 17:15:01,110 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4588 transitions. Word has length 101 [2025-02-05 17:15:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4588 transitions. [2025-02-05 17:15:01,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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:15:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4588 transitions. [2025-02-05 17:15:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:01,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:01,118 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] [2025-02-05 17:15:01,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:15:01,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash 267982704, now seen corresponding path program 1 times [2025-02-05 17:15:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:01,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979657883] [2025-02-05 17:15:01,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:01,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:01,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:01,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:01,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:01,400 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:15:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979657883] [2025-02-05 17:15:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979657883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200152562] [2025-02-05 17:15:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:01,404 INFO L87 Difference]: Start difference. First operand 2541 states and 4588 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:01,807 INFO L93 Difference]: Finished difference Result 2984 states and 5267 transitions. [2025-02-05 17:15:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:01,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:01,827 INFO L225 Difference]: With dead ends: 2984 [2025-02-05 17:15:01,827 INFO L226 Difference]: Without dead ends: 2577 [2025-02-05 17:15:01,831 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:15:01,833 INFO L435 NwaCegarLoop]: 4197 mSDtfsCounter, 4370 mSDsluCounter, 8309 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:01,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 12506 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:15:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-02-05 17:15:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2541. [2025-02-05 17:15:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8126754913758525) internal successors, (4519), 2496 states have internal predecessors, (4519), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-02-05 17:15:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4586 transitions. [2025-02-05 17:15:01,928 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4586 transitions. Word has length 101 [2025-02-05 17:15:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:01,928 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4586 transitions. [2025-02-05 17:15:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4586 transitions. [2025-02-05 17:15:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:01,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:01,932 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] [2025-02-05 17:15:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:15:01,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:01,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1475900879, now seen corresponding path program 1 times [2025-02-05 17:15:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506558592] [2025-02-05 17:15:01,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:01,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:01,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:01,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:01,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:02,183 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:15:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506558592] [2025-02-05 17:15:02,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506558592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:02,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:02,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779364151] [2025-02-05 17:15:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:02,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:02,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:02,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:02,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:02,185 INFO L87 Difference]: Start difference. First operand 2541 states and 4586 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:02,860 INFO L93 Difference]: Finished difference Result 3199 states and 5583 transitions. [2025-02-05 17:15:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:02,883 INFO L225 Difference]: With dead ends: 3199 [2025-02-05 17:15:02,884 INFO L226 Difference]: Without dead ends: 2792 [2025-02-05 17:15:02,888 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:15:02,888 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4514 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 17490 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:02,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4527 Valid, 17490 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2025-02-05 17:15:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2733. [2025-02-05 17:15:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2733 states, 2664 states have (on average 1.7909159159159158) internal successors, (4771), 2668 states have internal predecessors, (4771), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-05 17:15:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4869 transitions. [2025-02-05 17:15:03,004 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4869 transitions. Word has length 101 [2025-02-05 17:15:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:03,004 INFO L471 AbstractCegarLoop]: Abstraction has 2733 states and 4869 transitions. [2025-02-05 17:15:03,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4869 transitions. [2025-02-05 17:15:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:03,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:03,008 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] [2025-02-05 17:15:03,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:15:03,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:03,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash -9154672, now seen corresponding path program 1 times [2025-02-05 17:15:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016295566] [2025-02-05 17:15:03,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:03,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:03,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:03,205 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:15:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016295566] [2025-02-05 17:15:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016295566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383966803] [2025-02-05 17:15:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:03,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:03,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:03,207 INFO L87 Difference]: Start difference. First operand 2733 states and 4869 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:04,003 INFO L93 Difference]: Finished difference Result 3800 states and 6481 transitions. [2025-02-05 17:15:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:04,026 INFO L225 Difference]: With dead ends: 3800 [2025-02-05 17:15:04,026 INFO L226 Difference]: Without dead ends: 3201 [2025-02-05 17:15:04,031 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:15:04,032 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4509 mSDsluCounter, 13107 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 17474 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:04,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 17474 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-02-05 17:15:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3136. [2025-02-05 17:15:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3023 states have (on average 1.7552100562355277) internal successors, (5306), 3031 states have internal predecessors, (5306), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-02-05 17:15:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5472 transitions. [2025-02-05 17:15:04,192 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5472 transitions. Word has length 101 [2025-02-05 17:15:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:04,193 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5472 transitions. [2025-02-05 17:15:04,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5472 transitions. [2025-02-05 17:15:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:04,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:04,196 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] [2025-02-05 17:15:04,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:15:04,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash 774224303, now seen corresponding path program 1 times [2025-02-05 17:15:04,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927173199] [2025-02-05 17:15:04,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:04,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:04,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:04,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:04,385 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:15:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927173199] [2025-02-05 17:15:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927173199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:04,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904748346] [2025-02-05 17:15:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:04,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:04,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:04,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:04,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:04,387 INFO L87 Difference]: Start difference. First operand 3136 states and 5472 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:05,108 INFO L93 Difference]: Finished difference Result 5073 states and 8422 transitions. [2025-02-05 17:15:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:05,132 INFO L225 Difference]: With dead ends: 5073 [2025-02-05 17:15:05,133 INFO L226 Difference]: Without dead ends: 4071 [2025-02-05 17:15:05,139 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:15:05,140 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4504 mSDsluCounter, 13098 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 17462 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:05,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 17462 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-02-05 17:15:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3993. [2025-02-05 17:15:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3786 states have (on average 1.705758055995774) internal successors, (6458), 3808 states have internal predecessors, (6458), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-02-05 17:15:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 6784 transitions. [2025-02-05 17:15:05,363 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 6784 transitions. Word has length 101 [2025-02-05 17:15:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:05,363 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 6784 transitions. [2025-02-05 17:15:05,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 6784 transitions. [2025-02-05 17:15:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:05,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:05,366 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] [2025-02-05 17:15:05,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:15:05,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:05,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 245305264, now seen corresponding path program 1 times [2025-02-05 17:15:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255982716] [2025-02-05 17:15:05,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:05,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:05,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:05,524 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:15:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:05,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255982716] [2025-02-05 17:15:05,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255982716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:05,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:05,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799996074] [2025-02-05 17:15:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:05,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:05,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:05,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:05,525 INFO L87 Difference]: Start difference. First operand 3993 states and 6784 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:06,339 INFO L93 Difference]: Finished difference Result 8086 states and 13121 transitions. [2025-02-05 17:15:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:06,380 INFO L225 Difference]: With dead ends: 8086 [2025-02-05 17:15:06,381 INFO L226 Difference]: Without dead ends: 6227 [2025-02-05 17:15:06,391 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:15:06,392 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4660 mSDsluCounter, 13068 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 17423 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:06,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4679 Valid, 17423 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2025-02-05 17:15:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5791. [2025-02-05 17:15:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6531748978834013) internal successors, (8904), 5454 states have internal predecessors, (8904), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-02-05 17:15:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9630 transitions. [2025-02-05 17:15:06,717 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9630 transitions. Word has length 101 [2025-02-05 17:15:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9630 transitions. [2025-02-05 17:15:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9630 transitions. [2025-02-05 17:15:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:06,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:06,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:15:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:15:06,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 365425137, now seen corresponding path program 1 times [2025-02-05 17:15:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833519451] [2025-02-05 17:15:06,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:06,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:06,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:06,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:06,831 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:15:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833519451] [2025-02-05 17:15:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833519451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664662948] [2025-02-05 17:15:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:06,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:06,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:06,835 INFO L87 Difference]: Start difference. First operand 5791 states and 9630 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:07,312 INFO L93 Difference]: Finished difference Result 9946 states and 16320 transitions. [2025-02-05 17:15:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:07,365 INFO L225 Difference]: With dead ends: 9946 [2025-02-05 17:15:07,365 INFO L226 Difference]: Without dead ends: 6289 [2025-02-05 17:15:07,376 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:15:07,377 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4360 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 12466 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:07,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4373 Valid, 12466 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2025-02-05 17:15:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5791. [2025-02-05 17:15:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6500185666542888) internal successors, (8887), 5454 states have internal predecessors, (8887), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-02-05 17:15:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9613 transitions. [2025-02-05 17:15:07,647 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9613 transitions. Word has length 101 [2025-02-05 17:15:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9613 transitions. [2025-02-05 17:15:07,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9613 transitions. [2025-02-05 17:15:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:07,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:07,653 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] [2025-02-05 17:15:07,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:15:07,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:07,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 784941968, now seen corresponding path program 1 times [2025-02-05 17:15:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479108078] [2025-02-05 17:15:07,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:07,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:07,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:07,789 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:15:07,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:07,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479108078] [2025-02-05 17:15:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479108078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:07,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710376703] [2025-02-05 17:15:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:07,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:07,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:07,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:07,793 INFO L87 Difference]: Start difference. First operand 5791 states and 9613 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:08,593 INFO L93 Difference]: Finished difference Result 13810 states and 22442 transitions. [2025-02-05 17:15:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:08,645 INFO L225 Difference]: With dead ends: 13810 [2025-02-05 17:15:08,645 INFO L226 Difference]: Without dead ends: 10153 [2025-02-05 17:15:08,665 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:15:08,668 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4587 mSDsluCounter, 13045 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 17392 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:08,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 17392 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-02-05 17:15:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9579. [2025-02-05 17:15:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6043289051763627) internal successors, (14009), 8946 states have internal predecessors, (14009), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-02-05 17:15:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15903 transitions. [2025-02-05 17:15:09,275 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15903 transitions. Word has length 101 [2025-02-05 17:15:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15903 transitions. [2025-02-05 17:15:09,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15903 transitions. [2025-02-05 17:15:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:09,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:09,284 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] [2025-02-05 17:15:09,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:15:09,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:09,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash 798474769, now seen corresponding path program 1 times [2025-02-05 17:15:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61606956] [2025-02-05 17:15:09,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:09,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:09,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:09,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:09,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:09,376 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:15:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61606956] [2025-02-05 17:15:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61606956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:09,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:09,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912402816] [2025-02-05 17:15:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:09,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:09,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:09,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:09,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:09,378 INFO L87 Difference]: Start difference. First operand 9579 states and 15903 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:09,940 INFO L93 Difference]: Finished difference Result 18004 states and 30144 transitions. [2025-02-05 17:15:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:09,993 INFO L225 Difference]: With dead ends: 18004 [2025-02-05 17:15:09,993 INFO L226 Difference]: Without dead ends: 10559 [2025-02-05 17:15:10,019 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:15:10,022 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4356 mSDsluCounter, 8273 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:10,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12452 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-02-05 17:15:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 9579. [2025-02-05 17:15:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6005497022446176) internal successors, (13976), 8946 states have internal predecessors, (13976), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-02-05 17:15:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15870 transitions. [2025-02-05 17:15:10,480 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15870 transitions. Word has length 101 [2025-02-05 17:15:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15870 transitions. [2025-02-05 17:15:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15870 transitions. [2025-02-05 17:15:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:10,488 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] [2025-02-05 17:15:10,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:15:10,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1907289968, now seen corresponding path program 1 times [2025-02-05 17:15:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662309161] [2025-02-05 17:15:10,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:10,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:10,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:10,675 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:15:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:10,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662309161] [2025-02-05 17:15:10,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662309161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:10,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:10,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795826459] [2025-02-05 17:15:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:10,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:10,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:10,678 INFO L87 Difference]: Start difference. First operand 9579 states and 15870 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:11,287 INFO L93 Difference]: Finished difference Result 17759 states and 29588 transitions. [2025-02-05 17:15:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:11,405 INFO L225 Difference]: With dead ends: 17759 [2025-02-05 17:15:11,405 INFO L226 Difference]: Without dead ends: 10314 [2025-02-05 17:15:11,432 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:15:11,432 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4353 mSDsluCounter, 8268 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:11,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 12444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10314 states. [2025-02-05 17:15:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10314 to 9579. [2025-02-05 17:15:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.5967704993128722) internal successors, (13943), 8946 states have internal predecessors, (13943), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-02-05 17:15:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15837 transitions. [2025-02-05 17:15:11,925 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15837 transitions. Word has length 101 [2025-02-05 17:15:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:11,926 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15837 transitions. [2025-02-05 17:15:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:15:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15837 transitions. [2025-02-05 17:15:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:11,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:11,933 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] [2025-02-05 17:15:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:15:11,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1520625103, now seen corresponding path program 1 times [2025-02-05 17:15:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858333410] [2025-02-05 17:15:11,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:11,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:11,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:11,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:11,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:12,064 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:15:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858333410] [2025-02-05 17:15:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858333410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603271642] [2025-02-05 17:15:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:12,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:12,066 INFO L87 Difference]: Start difference. First operand 9579 states and 15837 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:13,572 INFO L93 Difference]: Finished difference Result 24974 states and 41916 transitions. [2025-02-05 17:15:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-02-05 17:15:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:13,668 INFO L225 Difference]: With dead ends: 24974 [2025-02-05 17:15:13,668 INFO L226 Difference]: Without dead ends: 17529 [2025-02-05 17:15:13,699 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:15:13,700 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4476 mSDsluCounter, 13008 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 17342 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:13,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 17342 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2025-02-05 17:15:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 17188. [2025-02-05 17:15:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 15311 states have (on average 1.5512376722617727) internal successors, (23751), 15979 states have internal predecessors, (23751), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-02-05 17:15:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 29485 transitions. [2025-02-05 17:15:14,631 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 29485 transitions. Word has length 101 [2025-02-05 17:15:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:14,632 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 29485 transitions. [2025-02-05 17:15:14,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:15:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 29485 transitions. [2025-02-05 17:15:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:15:14,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:14,641 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] [2025-02-05 17:15:14,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:15:14,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:14,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1077013680, now seen corresponding path program 1 times [2025-02-05 17:15:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728591180] [2025-02-05 17:15:14,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:14,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:15:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:15:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:14,706 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:15:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728591180] [2025-02-05 17:15:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728591180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:15:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700971496] [2025-02-05 17:15:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:14,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:15:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:14,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:15:14,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:15:14,709 INFO L87 Difference]: Start difference. First operand 17188 states and 29485 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:16,082 INFO L93 Difference]: Finished difference Result 46966 states and 80758 transitions. [2025-02-05 17:15:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:16,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-02-05 17:15:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:16,227 INFO L225 Difference]: With dead ends: 46966 [2025-02-05 17:15:16,227 INFO L226 Difference]: Without dead ends: 31913 [2025-02-05 17:15:16,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:15:16,276 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 4499 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 9021 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:16,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 9021 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:15:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31913 states. [2025-02-05 17:15:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31913 to 31848. [2025-02-05 17:15:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31848 states, 28100 states have (on average 1.5165836298932385) internal successors, (42616), 29499 states have internal predecessors, (42616), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-02-05 17:15:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31848 states to 31848 states and 54013 transitions. [2025-02-05 17:15:18,458 INFO L78 Accepts]: Start accepts. Automaton has 31848 states and 54013 transitions. Word has length 101 [2025-02-05 17:15:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:18,459 INFO L471 AbstractCegarLoop]: Abstraction has 31848 states and 54013 transitions. [2025-02-05 17:15:18,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31848 states and 54013 transitions. [2025-02-05 17:15:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:15:18,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:18,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:15:18,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:15:18,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:18,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash -638692433, now seen corresponding path program 1 times [2025-02-05 17:15:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215037306] [2025-02-05 17:15:18,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:15:18,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:15:18,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:18,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:15:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215037306] [2025-02-05 17:15:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215037306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:15:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218838942] [2025-02-05 17:15:18,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:18,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:15:18,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:15:18,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:15:18,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:15:18,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:15:18,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:15:18,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:18,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:18,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:15:18,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:15:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 17:15:18,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:15:18,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218838942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:18,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:15:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:15:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993694976] [2025-02-05 17:15:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:15:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:18,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:15:18,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:18,917 INFO L87 Difference]: Start difference. First operand 31848 states and 54013 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:15:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:21,085 INFO L93 Difference]: Finished difference Result 90623 states and 153823 transitions. [2025-02-05 17:15:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:15:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 166 [2025-02-05 17:15:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:21,543 INFO L225 Difference]: With dead ends: 90623 [2025-02-05 17:15:21,543 INFO L226 Difference]: Without dead ends: 60910 [2025-02-05 17:15:21,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:21,621 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4219 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:21,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:15:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60910 states. [2025-02-05 17:15:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60910 to 60518. [2025-02-05 17:15:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60518 states, 53158 states have (on average 1.5041197938221904) internal successors, (79956), 55954 states have internal predecessors, (79956), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-02-05 17:15:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 102419 transitions. [2025-02-05 17:15:25,798 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 102419 transitions. Word has length 166 [2025-02-05 17:15:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 60518 states and 102419 transitions. [2025-02-05 17:15:25,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:15:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 102419 transitions. [2025-02-05 17:15:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:15:25,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:25,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:15:25,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:15:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 17:15:26,092 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:26,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash -229481751, now seen corresponding path program 1 times [2025-02-05 17:15:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321952454] [2025-02-05 17:15:26,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:26,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:26,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:15:26,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:15:26,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:26,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:15:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321952454] [2025-02-05 17:15:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321952454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:15:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963986649] [2025-02-05 17:15:26,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:26,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:15:26,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:15:26,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:15:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:15:26,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:15:26,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:15:26,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:26,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:26,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:15:26,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:15:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 17:15:26,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:15:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963986649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:15:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:15:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954927898] [2025-02-05 17:15:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:15:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:26,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:15:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:26,440 INFO L87 Difference]: Start difference. First operand 60518 states and 102419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:15:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:31,177 INFO L93 Difference]: Finished difference Result 175983 states and 298721 transitions. [2025-02-05 17:15:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:15:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 166 [2025-02-05 17:15:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:31,735 INFO L225 Difference]: With dead ends: 175983 [2025-02-05 17:15:31,735 INFO L226 Difference]: Without dead ends: 117600 [2025-02-05 17:15:31,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:31,871 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4213 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:31,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:15:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117600 states.