./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3add2c82410ff745811ed91690a644a775913a086eeabc1a421c899bac857c34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:18:43,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:18:43,654 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:18:43,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:18:43,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:18:43,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:18:43,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:18:43,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:18:43,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:18:43,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:18:43,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:18:43,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:18:43,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:18:43,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:18:43,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:18:43,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:18:43,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:18:43,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:18:43,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:18:43,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:18:43,675 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 -> 3add2c82410ff745811ed91690a644a775913a086eeabc1a421c899bac857c34 [2025-02-05 17:18:43,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:18:43,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:18:43,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:18:43,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:18:43,901 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:18:43,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c [2025-02-05 17:18:45,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be89039ba/0e1ca1a953b74cdea016dea7f152021a/FLAGdc5edf384 [2025-02-05 17:18:45,713 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:18:45,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c [2025-02-05 17:18:45,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be89039ba/0e1ca1a953b74cdea016dea7f152021a/FLAGdc5edf384 [2025-02-05 17:18:45,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be89039ba/0e1ca1a953b74cdea016dea7f152021a [2025-02-05 17:18:45,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:18:45,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:18:45,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:18:45,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:18:45,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:18:45,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:18:45" (1/1) ... [2025-02-05 17:18:45,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdbbbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:45, skipping insertion in model container [2025-02-05 17:18:45,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:18:45" (1/1) ... [2025-02-05 17:18:45,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:18:46,983 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_label49+token_ring.04.cil-2.c[380593,380606] [2025-02-05 17:18:47,011 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_label49+token_ring.04.cil-2.c[383339,383352] [2025-02-05 17:18:47,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:18:47,230 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:18:47,754 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_label49+token_ring.04.cil-2.c[380593,380606] [2025-02-05 17:18:47,758 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_label49+token_ring.04.cil-2.c[383339,383352] [2025-02-05 17:18:47,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:18:47,806 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:18:47,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47 WrapperNode [2025-02-05 17:18:47,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:18:47,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:18:47,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:18:47,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:18:47,813 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:18:47" (1/1) ... [2025-02-05 17:18:47,888 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:18:47" (1/1) ... [2025-02-05 17:18:48,156 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-02-05 17:18:48,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:18:48,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:18:48,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:18:48,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:18:48,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,399 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:18:48,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:18:48,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:18:48,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:18:48,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:18:48,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:18:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:18:48,806 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:18:48,815 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:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:18:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:18:48,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:18:48,893 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:18:48,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:18:55,293 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:18:55,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:18:55,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:18:55,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:18:55,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:18:55,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:18:55,295 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:18:55,610 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2025-02-05 17:18:55,611 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:18:55,658 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:18:55,658 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:18:55,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:55 BoogieIcfgContainer [2025-02-05 17:18:55,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:18:55,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:18:55,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:18:55,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:18:55,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:18:45" (1/3) ... [2025-02-05 17:18:55,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c969095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:55, skipping insertion in model container [2025-02-05 17:18:55,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (2/3) ... [2025-02-05 17:18:55,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c969095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:55, skipping insertion in model container [2025-02-05 17:18:55,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:55" (3/3) ... [2025-02-05 17:18:55,667 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.04.cil-2.c [2025-02-05 17:18:55,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:18:55,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.04.cil-2.c that has 8 procedures, 2383 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-02-05 17:18:55,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:18:55,770 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;@7c31e30a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:18:55,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:18:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 2383 states, 2353 states have (on average 1.8474288142796431) internal successors, (4347), 2358 states have internal predecessors, (4347), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:18:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:55,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:55,786 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] [2025-02-05 17:18:55,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1522854527, now seen corresponding path program 1 times [2025-02-05 17:18:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406678931] [2025-02-05 17:18:55,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:55,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:55,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:55,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:56,141 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:18:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406678931] [2025-02-05 17:18:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406678931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277910264] [2025-02-05 17:18:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:56,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:56,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:56,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:56,166 INFO L87 Difference]: Start difference. First operand has 2383 states, 2353 states have (on average 1.8474288142796431) internal successors, (4347), 2358 states have internal predecessors, (4347), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:56,699 INFO L93 Difference]: Finished difference Result 4954 states and 9071 transitions. [2025-02-05 17:18:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:18:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:18:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:56,739 INFO L225 Difference]: With dead ends: 4954 [2025-02-05 17:18:56,739 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 17:18:56,778 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:18:56,781 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4520 mSDsluCounter, 8628 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4532 SdHoareTripleChecker+Valid, 12883 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:56,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4532 Valid, 12883 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 17:18:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2498. [2025-02-05 17:18:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2450 states have (on average 1.8191836734693878) internal successors, (4457), 2454 states have internal predecessors, (4457), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:18:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4522 transitions. [2025-02-05 17:18:56,943 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4522 transitions. Word has length 91 [2025-02-05 17:18:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:56,943 INFO L471 AbstractCegarLoop]: Abstraction has 2498 states and 4522 transitions. [2025-02-05 17:18:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4522 transitions. [2025-02-05 17:18:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:56,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:56,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:18:56,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1651981443, now seen corresponding path program 1 times [2025-02-05 17:18:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342261216] [2025-02-05 17:18:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:56,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:57,156 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:18:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342261216] [2025-02-05 17:18:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342261216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734006977] [2025-02-05 17:18:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:57,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:57,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:57,158 INFO L87 Difference]: Start difference. First operand 2498 states and 4522 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:57,432 INFO L93 Difference]: Finished difference Result 2893 states and 5125 transitions. [2025-02-05 17:18:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:18:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:57,443 INFO L225 Difference]: With dead ends: 2893 [2025-02-05 17:18:57,443 INFO L226 Difference]: Without dead ends: 2528 [2025-02-05 17:18:57,445 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:18:57,446 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4322 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 12443 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:57,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 12443 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-02-05 17:18:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2498. [2025-02-05 17:18:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2450 states have (on average 1.8183673469387756) internal successors, (4455), 2454 states have internal predecessors, (4455), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:18:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4520 transitions. [2025-02-05 17:18:57,513 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4520 transitions. Word has length 91 [2025-02-05 17:18:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:57,514 INFO L471 AbstractCegarLoop]: Abstraction has 2498 states and 4520 transitions. [2025-02-05 17:18:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4520 transitions. [2025-02-05 17:18:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:57,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:57,517 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] [2025-02-05 17:18:57,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:18:57,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash -784929218, now seen corresponding path program 1 times [2025-02-05 17:18:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975197918] [2025-02-05 17:18:57,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:57,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:57,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:57,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:57,662 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:18:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975197918] [2025-02-05 17:18:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975197918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663668037] [2025-02-05 17:18:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:57,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:57,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:57,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:57,666 INFO L87 Difference]: Start difference. First operand 2498 states and 4520 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:58,085 INFO L93 Difference]: Finished difference Result 3085 states and 5404 transitions. [2025-02-05 17:18:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:18:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:58,095 INFO L225 Difference]: With dead ends: 3085 [2025-02-05 17:18:58,095 INFO L226 Difference]: Without dead ends: 2720 [2025-02-05 17:18:58,097 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:18:58,097 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4438 mSDsluCounter, 12996 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 17330 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:58,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 17330 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2025-02-05 17:18:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2669. [2025-02-05 17:18:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2601 states have (on average 1.7985390234525183) internal successors, (4678), 2606 states have internal predecessors, (4678), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 17:18:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4772 transitions. [2025-02-05 17:18:58,190 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4772 transitions. Word has length 91 [2025-02-05 17:18:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4772 transitions. [2025-02-05 17:18:58,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4772 transitions. [2025-02-05 17:18:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:58,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:58,192 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] [2025-02-05 17:18:58,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:18:58,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -341317795, now seen corresponding path program 1 times [2025-02-05 17:18:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:58,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742568988] [2025-02-05 17:18:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:58,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:58,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:58,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:58,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:58,287 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:18:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742568988] [2025-02-05 17:18:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742568988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:58,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954420453] [2025-02-05 17:18:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:58,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:58,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:58,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:58,289 INFO L87 Difference]: Start difference. First operand 2669 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:58,738 INFO L93 Difference]: Finished difference Result 3617 states and 6197 transitions. [2025-02-05 17:18:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:18:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:58,750 INFO L225 Difference]: With dead ends: 3617 [2025-02-05 17:18:58,750 INFO L226 Difference]: Without dead ends: 3081 [2025-02-05 17:18:58,753 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:18:58,753 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4433 mSDsluCounter, 12984 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 17314 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:58,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 17314 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2025-02-05 17:18:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3026. [2025-02-05 17:18:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 2916 states have (on average 1.7650891632373114) internal successors, (5147), 2925 states have internal predecessors, (5147), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 17:18:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 5305 transitions. [2025-02-05 17:18:58,827 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 5305 transitions. Word has length 91 [2025-02-05 17:18:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:58,827 INFO L471 AbstractCegarLoop]: Abstraction has 3026 states and 5305 transitions. [2025-02-05 17:18:58,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 5305 transitions. [2025-02-05 17:18:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:58,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:58,829 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] [2025-02-05 17:18:58,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:18:58,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1296839074, now seen corresponding path program 1 times [2025-02-05 17:18:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189076221] [2025-02-05 17:18:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:58,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:58,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:58,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:58,921 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:18:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189076221] [2025-02-05 17:18:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189076221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25380732] [2025-02-05 17:18:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:58,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:58,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:58,923 INFO L87 Difference]: Start difference. First operand 3026 states and 5305 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:59,330 INFO L93 Difference]: Finished difference Result 4736 states and 7896 transitions. [2025-02-05 17:18:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:18:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:59,345 INFO L225 Difference]: With dead ends: 4736 [2025-02-05 17:18:59,346 INFO L226 Difference]: Without dead ends: 3843 [2025-02-05 17:18:59,350 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:18:59,350 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4428 mSDsluCounter, 12975 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4440 SdHoareTripleChecker+Valid, 17302 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:59,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4440 Valid, 17302 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2025-02-05 17:18:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3779. [2025-02-05 17:18:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3579 states have (on average 1.7164012293936854) internal successors, (6143), 3602 states have internal predecessors, (6143), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 17:18:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6453 transitions. [2025-02-05 17:18:59,445 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6453 transitions. Word has length 91 [2025-02-05 17:18:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:59,445 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6453 transitions. [2025-02-05 17:18:59,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6453 transitions. [2025-02-05 17:18:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:18:59,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:59,450 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] [2025-02-05 17:18:59,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:18:59,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 889094973, now seen corresponding path program 1 times [2025-02-05 17:18:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551873300] [2025-02-05 17:18:59,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:59,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:18:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:18:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:59,562 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:18:59,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:59,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551873300] [2025-02-05 17:18:59,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551873300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:59,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:59,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:59,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296952844] [2025-02-05 17:18:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:59,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:59,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:59,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:59,564 INFO L87 Difference]: Start difference. First operand 3779 states and 6453 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:00,102 INFO L93 Difference]: Finished difference Result 7375 states and 12003 transitions. [2025-02-05 17:19:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:00,126 INFO L225 Difference]: With dead ends: 7375 [2025-02-05 17:19:00,126 INFO L226 Difference]: Without dead ends: 5729 [2025-02-05 17:19:00,133 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:19:00,134 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4557 mSDsluCounter, 12955 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 17277 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:00,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 17277 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:19:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2025-02-05 17:19:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5360. [2025-02-05 17:19:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4970 states have (on average 1.6617706237424548) internal successors, (8259), 5039 states have internal predecessors, (8259), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:19:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 8953 transitions. [2025-02-05 17:19:00,298 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 8953 transitions. Word has length 91 [2025-02-05 17:19:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:00,298 INFO L471 AbstractCegarLoop]: Abstraction has 5360 states and 8953 transitions. [2025-02-05 17:19:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 8953 transitions. [2025-02-05 17:19:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:19:00,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:00,301 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] [2025-02-05 17:19:00,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:19:00,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash 405419646, now seen corresponding path program 1 times [2025-02-05 17:19:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102735388] [2025-02-05 17:19:00,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:00,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:19:00,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:19:00,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:00,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:00,365 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:19:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102735388] [2025-02-05 17:19:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102735388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:00,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785780515] [2025-02-05 17:19:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:00,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:00,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:00,367 INFO L87 Difference]: Start difference. First operand 5360 states and 8953 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:00,652 INFO L93 Difference]: Finished difference Result 9002 states and 14802 transitions. [2025-02-05 17:19:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:00,673 INFO L225 Difference]: With dead ends: 9002 [2025-02-05 17:19:00,674 INFO L226 Difference]: Without dead ends: 5775 [2025-02-05 17:19:00,681 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:19:00,681 INFO L435 NwaCegarLoop]: 4154 mSDtfsCounter, 4320 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 12391 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:00,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 12391 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:19:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2025-02-05 17:19:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5360. [2025-02-05 17:19:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4970 states have (on average 1.6583501006036216) internal successors, (8242), 5039 states have internal predecessors, (8242), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:19:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 8936 transitions. [2025-02-05 17:19:00,841 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 8936 transitions. Word has length 91 [2025-02-05 17:19:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 5360 states and 8936 transitions. [2025-02-05 17:19:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 8936 transitions. [2025-02-05 17:19:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:19:00,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:00,845 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] [2025-02-05 17:19:00,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:19:00,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1359648541, now seen corresponding path program 1 times [2025-02-05 17:19:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632183057] [2025-02-05 17:19:00,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:00,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:19:00,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:19:00,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:00,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:00,917 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:19:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632183057] [2025-02-05 17:19:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632183057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:00,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181849289] [2025-02-05 17:19:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:00,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:00,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:00,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:00,919 INFO L87 Difference]: Start difference. First operand 5360 states and 8936 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:01,463 INFO L93 Difference]: Finished difference Result 12330 states and 20074 transitions. [2025-02-05 17:19:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:01,492 INFO L225 Difference]: With dead ends: 12330 [2025-02-05 17:19:01,492 INFO L226 Difference]: Without dead ends: 9103 [2025-02-05 17:19:01,502 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:19:01,502 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4484 mSDsluCounter, 12932 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4501 SdHoareTripleChecker+Valid, 17246 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:01,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4501 Valid, 17246 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:19:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9103 states. [2025-02-05 17:19:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9103 to 8660. [2025-02-05 17:19:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.6058133605303417) internal successors, (12596), 8059 states have internal predecessors, (12596), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14426 transitions. [2025-02-05 17:19:01,789 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14426 transitions. Word has length 91 [2025-02-05 17:19:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:01,789 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14426 transitions. [2025-02-05 17:19:01,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14426 transitions. [2025-02-05 17:19:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:19:01,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:01,794 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] [2025-02-05 17:19:01,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:19:01,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:01,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1113335454, now seen corresponding path program 1 times [2025-02-05 17:19:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246252496] [2025-02-05 17:19:01,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:01,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:19:01,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:19:01,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:01,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:19:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246252496] [2025-02-05 17:19:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246252496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150729245] [2025-02-05 17:19:01,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:01,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:01,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:01,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:01,978 INFO L87 Difference]: Start difference. First operand 8660 states and 14426 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:02,548 INFO L93 Difference]: Finished difference Result 15922 states and 26702 transitions. [2025-02-05 17:19:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:02,581 INFO L225 Difference]: With dead ends: 15922 [2025-02-05 17:19:02,581 INFO L226 Difference]: Without dead ends: 9395 [2025-02-05 17:19:02,599 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:19:02,601 INFO L435 NwaCegarLoop]: 4158 mSDtfsCounter, 4309 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12395 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:02,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12395 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2025-02-05 17:19:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 8660. [2025-02-05 17:19:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.6016063233044364) internal successors, (12563), 8059 states have internal predecessors, (12563), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14393 transitions. [2025-02-05 17:19:02,932 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14393 transitions. Word has length 91 [2025-02-05 17:19:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14393 transitions. [2025-02-05 17:19:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14393 transitions. [2025-02-05 17:19:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:19:02,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:02,938 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] [2025-02-05 17:19:02,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:19:02,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -557178115, now seen corresponding path program 1 times [2025-02-05 17:19:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247766451] [2025-02-05 17:19:02,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:19:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:19:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:03,013 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:19:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247766451] [2025-02-05 17:19:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247766451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548583672] [2025-02-05 17:19:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:03,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:03,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:03,014 INFO L87 Difference]: Start difference. First operand 8660 states and 14393 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:03,622 INFO L93 Difference]: Finished difference Result 15677 states and 26146 transitions. [2025-02-05 17:19:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:03,650 INFO L225 Difference]: With dead ends: 15677 [2025-02-05 17:19:03,651 INFO L226 Difference]: Without dead ends: 9150 [2025-02-05 17:19:03,666 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:19:03,667 INFO L435 NwaCegarLoop]: 4155 mSDtfsCounter, 4306 mSDsluCounter, 8232 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 12387 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:03,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 12387 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9150 states. [2025-02-05 17:19:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9150 to 8660. [2025-02-05 17:19:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.5973992860785313) internal successors, (12530), 8059 states have internal predecessors, (12530), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14360 transitions. [2025-02-05 17:19:04,088 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14360 transitions. Word has length 91 [2025-02-05 17:19:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:04,088 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14360 transitions. [2025-02-05 17:19:04,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14360 transitions. [2025-02-05 17:19:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:19:04,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:04,093 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] [2025-02-05 17:19:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:19:04,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1165254978, now seen corresponding path program 1 times [2025-02-05 17:19:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675767195] [2025-02-05 17:19:04,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:04,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:19:04,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:19:04,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:04,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:04,141 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:19:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675767195] [2025-02-05 17:19:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675767195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:19:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313040491] [2025-02-05 17:19:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:04,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:19:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:04,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:19:04,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:19:04,143 INFO L87 Difference]: Start difference. First operand 8660 states and 14360 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:04,587 INFO L93 Difference]: Finished difference Result 21377 states and 34893 transitions. [2025-02-05 17:19:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:19:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:04,630 INFO L225 Difference]: With dead ends: 21377 [2025-02-05 17:19:04,630 INFO L226 Difference]: Without dead ends: 14851 [2025-02-05 17:19:04,646 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:19:04,647 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4434 mSDsluCounter, 4405 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 8879 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:04,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 8879 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:19:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14851 states. [2025-02-05 17:19:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14851 to 14818. [2025-02-05 17:19:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14818 states, 13194 states have (on average 1.538123389419433) internal successors, (20294), 13654 states have internal predecessors, (20294), 802 states have call successors, (802), 397 states have call predecessors, (802), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-02-05 17:19:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14818 states to 14818 states and 23913 transitions. [2025-02-05 17:19:05,415 INFO L78 Accepts]: Start accepts. Automaton has 14818 states and 23913 transitions. Word has length 91 [2025-02-05 17:19:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 14818 states and 23913 transitions. [2025-02-05 17:19:05,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14818 states and 23913 transitions. [2025-02-05 17:19:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:19:05,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:05,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:19:05,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -362071702, now seen corresponding path program 1 times [2025-02-05 17:19:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149264528] [2025-02-05 17:19:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:05,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:05,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:05,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:05,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149264528] [2025-02-05 17:19:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149264528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888692015] [2025-02-05 17:19:05,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:05,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:05,516 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:19:05,517 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:19:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:05,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:05,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:05,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 17:19:05,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888692015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786788408] [2025-02-05 17:19:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:05,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:05,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:05,700 INFO L87 Difference]: Start difference. First operand 14818 states and 23913 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:06,853 INFO L93 Difference]: Finished difference Result 39855 states and 63621 transitions. [2025-02-05 17:19:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:19:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:06,958 INFO L225 Difference]: With dead ends: 39855 [2025-02-05 17:19:06,958 INFO L226 Difference]: Without dead ends: 27171 [2025-02-05 17:19:06,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:19:06,999 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4191 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4191 SdHoareTripleChecker+Valid, 4492 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:19:06,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4191 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27171 states. [2025-02-05 17:19:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27171 to 26969. [2025-02-05 17:19:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26969 states, 23795 states have (on average 1.5109897037192688) internal successors, (35954), 24712 states have internal predecessors, (35954), 1532 states have call successors, (1532), 793 states have call predecessors, (1532), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-02-05 17:19:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26969 states to 26969 states and 43019 transitions. [2025-02-05 17:19:08,183 INFO L78 Accepts]: Start accepts. Automaton has 26969 states and 43019 transitions. Word has length 149 [2025-02-05 17:19:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:08,184 INFO L471 AbstractCegarLoop]: Abstraction has 26969 states and 43019 transitions. [2025-02-05 17:19:08,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26969 states and 43019 transitions. [2025-02-05 17:19:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:19:08,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:08,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,226 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:19:08,419 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,SelfDestructingSolverStorable11 [2025-02-05 17:19:08,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 665905444, now seen corresponding path program 1 times [2025-02-05 17:19:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647858411] [2025-02-05 17:19:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647858411] [2025-02-05 17:19:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647858411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296138663] [2025-02-05 17:19:08,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:08,491 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:19:08,493 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:19:08,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:08,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:08,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:08,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:08,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:19:08,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296138663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546916871] [2025-02-05 17:19:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:08,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:08,645 INFO L87 Difference]: Start difference. First operand 26969 states and 43019 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:10,198 INFO L93 Difference]: Finished difference Result 75978 states and 120745 transitions. [2025-02-05 17:19:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:19:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:10,381 INFO L225 Difference]: With dead ends: 75978 [2025-02-05 17:19:10,382 INFO L226 Difference]: Without dead ends: 51143 [2025-02-05 17:19:10,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:19:10,442 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4185 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4492 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:19:10,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51143 states. [2025-02-05 17:19:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51143 to 50743. [2025-02-05 17:19:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50743 states, 44535 states have (on average 1.4957673739755248) internal successors, (66614), 46366 states have internal predecessors, (66614), 2926 states have call successors, (2926), 1585 states have call predecessors, (2926), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-02-05 17:19:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50743 states to 50743 states and 80439 transitions. [2025-02-05 17:19:13,338 INFO L78 Accepts]: Start accepts. Automaton has 50743 states and 80439 transitions. Word has length 149 [2025-02-05 17:19:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:13,339 INFO L471 AbstractCegarLoop]: Abstraction has 50743 states and 80439 transitions. [2025-02-05 17:19:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 50743 states and 80439 transitions. [2025-02-05 17:19:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:19:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:13,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:13,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:19:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:13,641 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2012965982, now seen corresponding path program 1 times [2025-02-05 17:19:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084865595] [2025-02-05 17:19:13,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:13,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:13,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:13,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:13,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084865595] [2025-02-05 17:19:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084865595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689033200] [2025-02-05 17:19:13,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:13,708 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:19:13,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:13,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:13,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:13,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 17:19:13,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689033200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622911676] [2025-02-05 17:19:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:13,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:13,852 INFO L87 Difference]: Start difference. First operand 50743 states and 80439 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:18,098 INFO L93 Difference]: Finished difference Result 147024 states and 233191 transitions. [2025-02-05 17:19:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:19:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:18,487 INFO L225 Difference]: With dead ends: 147024 [2025-02-05 17:19:18,487 INFO L226 Difference]: Without dead ends: 98415 [2025-02-05 17:19:18,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:19:18,630 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4197 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4492 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:19:18,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98415 states. [2025-02-05 17:19:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98415 to 97619. [2025-02-05 17:19:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97619 states, 85347 states have (on average 1.4865197370733594) internal successors, (126870), 89006 states have internal predecessors, (126870), 5710 states have call successors, (5710), 3169 states have call predecessors, (5710), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-02-05 17:19:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97619 states to 97619 states and 154207 transitions. [2025-02-05 17:19:23,038 INFO L78 Accepts]: Start accepts. Automaton has 97619 states and 154207 transitions. Word has length 149 [2025-02-05 17:19:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 97619 states and 154207 transitions. [2025-02-05 17:19:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 97619 states and 154207 transitions. [2025-02-05 17:19:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:19:23,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:23,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:19:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:23,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:23,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1085740904, now seen corresponding path program 1 times [2025-02-05 17:19:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589718079] [2025-02-05 17:19:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:23,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:23,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:23,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:23,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589718079] [2025-02-05 17:19:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589718079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927537745] [2025-02-05 17:19:23,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:23,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:23,418 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:23,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:19:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:19:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:19:23,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:23,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:23,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:19:23,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927537745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233032818] [2025-02-05 17:19:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:23,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:23,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:23,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:23,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:23,608 INFO L87 Difference]: Start difference. First operand 97619 states and 154207 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)