./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 546425dfb0e9d0673715f309b3c99445cd7a29ebb128e47cf94e5f13217a2c6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:01:44,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:01:45,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:01:45,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:01:45,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:01:45,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:01:45,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:01:45,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:01:45,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:01:45,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:01:45,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:01:45,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:01:45,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:01:45,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:01:45,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:01:45,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:01:45,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:01:45,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:01:45,080 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/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 -> 546425dfb0e9d0673715f309b3c99445cd7a29ebb128e47cf94e5f13217a2c6c [2025-03-16 20:01:45,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:01:45,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:01:45,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:01:45,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:01:45,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:01:45,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c [2025-03-16 20:01:46,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d979a8f8b/cf9fbc91979043599cdf6e73d6dde9da/FLAGaea97fdcc [2025-03-16 20:01:46,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:01:46,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c [2025-03-16 20:01:47,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d979a8f8b/cf9fbc91979043599cdf6e73d6dde9da/FLAGaea97fdcc [2025-03-16 20:01:47,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d979a8f8b/cf9fbc91979043599cdf6e73d6dde9da [2025-03-16 20:01:47,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:01:47,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:01:47,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:01:47,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:01:47,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:01:47,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:01:47" (1/1) ... [2025-03-16 20:01:47,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:47, skipping insertion in model container [2025-03-16 20:01:47,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:01:47" (1/1) ... [2025-03-16 20:01:47,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:01:48,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c[380323,380336] [2025-03-16 20:01:48,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c[383339,383352] [2025-03-16 20:01:48,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:01:48,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:01:48,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c[380323,380336] [2025-03-16 20:01:48,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.04.cil-2.c[383339,383352] [2025-03-16 20:01:48,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:01:48,895 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:01:48,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48 WrapperNode [2025-03-16 20:01:48,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:01:48,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:01:48,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:01:48,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:01:48,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:48,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,211 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-03-16 20:01:49,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:01:49,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:01:49,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:01:49,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:01:49,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,428 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-03-16 20:01:49,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:01:49,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:01:49,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:01:49,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:01:49,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (1/1) ... [2025-03-16 20:01:49,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:01:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:49,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:01:49,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:01:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:01:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:01:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:01:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:01:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:01:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:01:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:01:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:01:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:01:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:01:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:01:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:01:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:01:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:01:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:01:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:01:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:01:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:01:49,901 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:01:49,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:01:56,014 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:01:56,015 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:01:56,016 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:01:56,016 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:01:56,016 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:01:56,016 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:01:56,017 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:01:56,192 INFO L? ?]: Removed 1704 outVars from TransFormulas that were not future-live. [2025-03-16 20:01:56,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:01:56,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:01:56,246 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:01:56,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:01:56 BoogieIcfgContainer [2025-03-16 20:01:56,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:01:56,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:01:56,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:01:56,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:01:56,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:01:47" (1/3) ... [2025-03-16 20:01:56,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e271dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:01:56, skipping insertion in model container [2025-03-16 20:01:56,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:48" (2/3) ... [2025-03-16 20:01:56,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e271dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:01:56, skipping insertion in model container [2025-03-16 20:01:56,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:01:56" (3/3) ... [2025-03-16 20:01:56,255 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.04.cil-2.c [2025-03-16 20:01:56,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:01:56,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.04.cil-2.c that has 8 procedures, 2301 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-16 20:01:56,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:01:56,379 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;@68e52937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:01:56,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:01:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 2301 states, 2272 states have (on average 1.877200704225352) internal successors, (4265), 2276 states have internal predecessors, (4265), 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-03-16 20:01:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:01:56,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:56,401 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] [2025-03-16 20:01:56,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -509594735, now seen corresponding path program 1 times [2025-03-16 20:01:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73002504] [2025-03-16 20:01:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:56,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:01:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:01:56,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:56,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73002504] [2025-03-16 20:01:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73002504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:56,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640548501] [2025-03-16 20:01:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:56,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:56,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:56,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:56,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:56,837 INFO L87 Difference]: Start difference. First operand has 2301 states, 2272 states have (on average 1.877200704225352) internal successors, (4265), 2276 states have internal predecessors, (4265), 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 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:01:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:57,326 INFO L93 Difference]: Finished difference Result 4773 states and 8890 transitions. [2025-03-16 20:01:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:01:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 20:01:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:57,354 INFO L225 Difference]: With dead ends: 4773 [2025-03-16 20:01:57,354 INFO L226 Difference]: Without dead ends: 2474 [2025-03-16 20:01:57,362 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-03-16 20:01:57,364 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4431 mSDsluCounter, 8455 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:57,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 12631 Invalid, 338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2025-03-16 20:01:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2459. [2025-03-16 20:01:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2411 states have (on average 1.832434674408959) internal successors, (4418), 2415 states have internal predecessors, (4418), 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-03-16 20:01:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4483 transitions. [2025-03-16 20:01:57,573 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4483 transitions. Word has length 82 [2025-03-16 20:01:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4483 transitions. [2025-03-16 20:01:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:01:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4483 transitions. [2025-03-16 20:01:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:01:57,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:57,577 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] [2025-03-16 20:01:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:01:57,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1010644367, now seen corresponding path program 1 times [2025-03-16 20:01:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590980350] [2025-03-16 20:01:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:57,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:01:57,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:01:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590980350] [2025-03-16 20:01:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590980350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462624572] [2025-03-16 20:01:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:57,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:57,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:57,781 INFO L87 Difference]: Start difference. First operand 2459 states and 4483 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:58,015 INFO L93 Difference]: Finished difference Result 2817 states and 5049 transitions. [2025-03-16 20:01:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:01:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:58,034 INFO L225 Difference]: With dead ends: 2817 [2025-03-16 20:01:58,035 INFO L226 Difference]: Without dead ends: 2489 [2025-03-16 20:01:58,038 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-03-16 20:01:58,039 INFO L435 NwaCegarLoop]: 4139 mSDtfsCounter, 4315 mSDsluCounter, 8218 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4327 SdHoareTripleChecker+Valid, 12357 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:58,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4327 Valid, 12357 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-16 20:01:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2459. [2025-03-16 20:01:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2411 states have (on average 1.8316051430941518) internal successors, (4416), 2415 states have internal predecessors, (4416), 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-03-16 20:01:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2025-03-16 20:01:58,123 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 82 [2025-03-16 20:01:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:58,124 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2025-03-16 20:01:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2025-03-16 20:01:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:01:58,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:58,128 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] [2025-03-16 20:01:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:01:58,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1613809360, now seen corresponding path program 1 times [2025-03-16 20:01:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847336334] [2025-03-16 20:01:58,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:01:58,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:01:58,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:58,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847336334] [2025-03-16 20:01:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847336334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717562601] [2025-03-16 20:01:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:58,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:58,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:58,265 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:58,684 INFO L93 Difference]: Finished difference Result 2991 states and 5310 transitions. [2025-03-16 20:01:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:01:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:58,696 INFO L225 Difference]: With dead ends: 2991 [2025-03-16 20:01:58,696 INFO L226 Difference]: Without dead ends: 2663 [2025-03-16 20:01:58,698 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-03-16 20:01:58,698 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4410 mSDsluCounter, 12895 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 17200 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:58,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 17200 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-16 20:01:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2612. [2025-03-16 20:01:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2544 states have (on average 1.816430817610063) internal successors, (4621), 2549 states have internal predecessors, (4621), 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-03-16 20:01:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4715 transitions. [2025-03-16 20:01:58,758 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 4715 transitions. Word has length 82 [2025-03-16 20:01:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 2612 states and 4715 transitions. [2025-03-16 20:01:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 4715 transitions. [2025-03-16 20:01:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:01:58,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:58,760 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] [2025-03-16 20:01:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:01:58,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:58,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1005732497, now seen corresponding path program 1 times [2025-03-16 20:01:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141523196] [2025-03-16 20:01:58,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:58,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:01:58,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:01:58,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:58,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141523196] [2025-03-16 20:01:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141523196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395734936] [2025-03-16 20:01:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:58,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:58,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:58,987 INFO L87 Difference]: Start difference. First operand 2612 states and 4715 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:59,557 INFO L93 Difference]: Finished difference Result 3469 states and 6049 transitions. [2025-03-16 20:01:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:01:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:59,568 INFO L225 Difference]: With dead ends: 3469 [2025-03-16 20:01:59,568 INFO L226 Difference]: Without dead ends: 2988 [2025-03-16 20:01:59,571 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-03-16 20:01:59,572 INFO L435 NwaCegarLoop]: 4301 mSDtfsCounter, 4405 mSDsluCounter, 12883 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 17184 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:59,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 17184 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:01:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2025-03-16 20:01:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2933. [2025-03-16 20:01:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2823 states have (on average 1.7902940134608571) internal successors, (5054), 2832 states have internal predecessors, (5054), 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-03-16 20:01:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 5212 transitions. [2025-03-16 20:01:59,658 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 5212 transitions. Word has length 82 [2025-03-16 20:01:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 5212 transitions. [2025-03-16 20:01:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:01:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 5212 transitions. [2025-03-16 20:01:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:01:59,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:59,660 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] [2025-03-16 20:01:59,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:01:59,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:59,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1507734864, now seen corresponding path program 1 times [2025-03-16 20:01:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979842825] [2025-03-16 20:01:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:59,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:01:59,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:01:59,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:59,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:59,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979842825] [2025-03-16 20:01:59,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979842825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:59,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:59,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546144747] [2025-03-16 20:01:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:59,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:59,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:59,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:59,741 INFO L87 Difference]: Start difference. First operand 2933 states and 5212 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:00,185 INFO L93 Difference]: Finished difference Result 4480 states and 7640 transitions. [2025-03-16 20:02:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:00,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:00,204 INFO L225 Difference]: With dead ends: 4480 [2025-03-16 20:02:00,204 INFO L226 Difference]: Without dead ends: 3678 [2025-03-16 20:02:00,208 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-03-16 20:02:00,209 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4400 mSDsluCounter, 12874 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 17172 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:00,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 17172 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:02:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2025-03-16 20:02:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3614. [2025-03-16 20:02:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3414 states have (on average 1.7510251903925014) internal successors, (5978), 3437 states have internal predecessors, (5978), 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-03-16 20:02:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6288 transitions. [2025-03-16 20:02:00,317 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 6288 transitions. Word has length 82 [2025-03-16 20:02:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 6288 transitions. [2025-03-16 20:02:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 6288 transitions. [2025-03-16 20:02:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:00,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:00,322 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] [2025-03-16 20:02:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:02:00,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:00,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -203341135, now seen corresponding path program 1 times [2025-03-16 20:02:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967596783] [2025-03-16 20:02:00,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:00,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:00,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967596783] [2025-03-16 20:02:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967596783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:00,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:00,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:00,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810701869] [2025-03-16 20:02:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:00,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:00,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:00,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:00,449 INFO L87 Difference]: Start difference. First operand 3614 states and 6288 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:00,972 INFO L93 Difference]: Finished difference Result 6863 states and 11491 transitions. [2025-03-16 20:02:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:00,999 INFO L225 Difference]: With dead ends: 6863 [2025-03-16 20:02:00,999 INFO L226 Difference]: Without dead ends: 5380 [2025-03-16 20:02:01,006 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-03-16 20:02:01,007 INFO L435 NwaCegarLoop]: 4293 mSDtfsCounter, 4433 mSDsluCounter, 12854 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4444 SdHoareTripleChecker+Valid, 17147 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:01,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4444 Valid, 17147 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:02:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2025-03-16 20:02:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5051. [2025-03-16 20:02:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4661 states have (on average 1.7056425659729673) internal successors, (7950), 4730 states have internal predecessors, (7950), 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-03-16 20:02:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 8644 transitions. [2025-03-16 20:02:01,178 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 8644 transitions. Word has length 82 [2025-03-16 20:02:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:01,179 INFO L471 AbstractCegarLoop]: Abstraction has 5051 states and 8644 transitions. [2025-03-16 20:02:01,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 8644 transitions. [2025-03-16 20:02:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:01,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:01,182 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] [2025-03-16 20:02:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:02:01,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:01,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1916946064, now seen corresponding path program 1 times [2025-03-16 20:02:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646579383] [2025-03-16 20:02:01,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:01,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:01,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:01,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:01,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646579383] [2025-03-16 20:02:01,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646579383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:01,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:01,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:01,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314572563] [2025-03-16 20:02:01,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:01,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:01,262 INFO L87 Difference]: Start difference. First operand 5051 states and 8644 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:01,593 INFO L93 Difference]: Finished difference Result 8386 states and 14186 transitions. [2025-03-16 20:02:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:01,625 INFO L225 Difference]: With dead ends: 8386 [2025-03-16 20:02:01,626 INFO L226 Difference]: Without dead ends: 5466 [2025-03-16 20:02:01,634 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-03-16 20:02:01,635 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4289 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4301 SdHoareTripleChecker+Valid, 12361 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:01,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4301 Valid, 12361 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2025-03-16 20:02:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5051. [2025-03-16 20:02:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4661 states have (on average 1.7019952799828364) internal successors, (7933), 4730 states have internal predecessors, (7933), 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-03-16 20:02:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 8627 transitions. [2025-03-16 20:02:01,812 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 8627 transitions. Word has length 82 [2025-03-16 20:02:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:01,813 INFO L471 AbstractCegarLoop]: Abstraction has 5051 states and 8627 transitions. [2025-03-16 20:02:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 8627 transitions. [2025-03-16 20:02:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:01,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:01,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:02:01,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:01,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1708247761, now seen corresponding path program 1 times [2025-03-16 20:02:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674979174] [2025-03-16 20:02:01,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:01,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:01,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674979174] [2025-03-16 20:02:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674979174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212676913] [2025-03-16 20:02:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:01,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:01,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:01,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:01,909 INFO L87 Difference]: Start difference. First operand 5051 states and 8627 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:02,627 INFO L93 Difference]: Finished difference Result 11378 states and 19122 transitions. [2025-03-16 20:02:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:02,659 INFO L225 Difference]: With dead ends: 11378 [2025-03-16 20:02:02,661 INFO L226 Difference]: Without dead ends: 8458 [2025-03-16 20:02:02,674 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-03-16 20:02:02,675 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 4447 mSDsluCounter, 12831 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 17116 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:02,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 17116 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:02:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2025-03-16 20:02:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8063. [2025-03-16 20:02:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6557196081137022) internal successors, (11999), 7462 states have internal predecessors, (11999), 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-03-16 20:02:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13829 transitions. [2025-03-16 20:02:02,992 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13829 transitions. Word has length 82 [2025-03-16 20:02:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:02,992 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13829 transitions. [2025-03-16 20:02:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13829 transitions. [2025-03-16 20:02:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:02,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:02,998 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] [2025-03-16 20:02:02,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:02:02,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash -99599760, now seen corresponding path program 1 times [2025-03-16 20:02:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117577269] [2025-03-16 20:02:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:03,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:03,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:03,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:03,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117577269] [2025-03-16 20:02:03,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117577269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:03,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72164896] [2025-03-16 20:02:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:03,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:03,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:03,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:03,069 INFO L87 Difference]: Start difference. First operand 8063 states and 13829 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:03,459 INFO L93 Difference]: Finished difference Result 14730 states and 25510 transitions. [2025-03-16 20:02:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:03,490 INFO L225 Difference]: With dead ends: 14730 [2025-03-16 20:02:03,490 INFO L226 Difference]: Without dead ends: 8798 [2025-03-16 20:02:03,506 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-03-16 20:02:03,507 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4285 mSDsluCounter, 8205 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 12347 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:03,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 12347 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:02:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2025-03-16 20:02:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 8063. [2025-03-16 20:02:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6511659997240238) internal successors, (11966), 7462 states have internal predecessors, (11966), 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-03-16 20:02:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13796 transitions. [2025-03-16 20:02:04,092 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13796 transitions. Word has length 82 [2025-03-16 20:02:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:04,092 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13796 transitions. [2025-03-16 20:02:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13796 transitions. [2025-03-16 20:02:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:04,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:04,098 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] [2025-03-16 20:02:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:02:04,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1266296079, now seen corresponding path program 1 times [2025-03-16 20:02:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564983191] [2025-03-16 20:02:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:04,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:04,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564983191] [2025-03-16 20:02:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564983191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461600757] [2025-03-16 20:02:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:04,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:04,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:04,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:04,256 INFO L87 Difference]: Start difference. First operand 8063 states and 13796 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:04,664 INFO L93 Difference]: Finished difference Result 14485 states and 24954 transitions. [2025-03-16 20:02:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:04,691 INFO L225 Difference]: With dead ends: 14485 [2025-03-16 20:02:04,691 INFO L226 Difference]: Without dead ends: 8553 [2025-03-16 20:02:04,706 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-03-16 20:02:04,706 INFO L435 NwaCegarLoop]: 4136 mSDtfsCounter, 4283 mSDsluCounter, 8197 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4295 SdHoareTripleChecker+Valid, 12333 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:04,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4295 Valid, 12333 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:02:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2025-03-16 20:02:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 8063. [2025-03-16 20:02:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6466123913343453) internal successors, (11933), 7462 states have internal predecessors, (11933), 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-03-16 20:02:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13763 transitions. [2025-03-16 20:02:05,038 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13763 transitions. Word has length 82 [2025-03-16 20:02:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13763 transitions. [2025-03-16 20:02:05,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13763 transitions. [2025-03-16 20:02:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:05,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:05,044 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] [2025-03-16 20:02:05,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:02:05,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:05,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1165384112, now seen corresponding path program 1 times [2025-03-16 20:02:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971497368] [2025-03-16 20:02:05,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:05,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:05,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:05,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:05,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971497368] [2025-03-16 20:02:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971497368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:02:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597909208] [2025-03-16 20:02:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:02:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:05,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:02:05,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:02:05,093 INFO L87 Difference]: Start difference. First operand 8063 states and 13763 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:05,897 INFO L93 Difference]: Finished difference Result 19807 states and 33319 transitions. [2025-03-16 20:02:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:05,941 INFO L225 Difference]: With dead ends: 19807 [2025-03-16 20:02:05,942 INFO L226 Difference]: Without dead ends: 13876 [2025-03-16 20:02:05,956 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-03-16 20:02:05,957 INFO L435 NwaCegarLoop]: 4446 mSDtfsCounter, 4422 mSDsluCounter, 4377 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8823 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:05,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8823 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13876 states. [2025-03-16 20:02:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13876 to 13839. [2025-03-16 20:02:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 12232 states have (on average 1.6047253106605626) internal successors, (19629), 12659 states have internal predecessors, (19629), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 20:02:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 23214 transitions. [2025-03-16 20:02:06,569 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 23214 transitions. Word has length 82 [2025-03-16 20:02:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 23214 transitions. [2025-03-16 20:02:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 23214 transitions. [2025-03-16 20:02:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:06,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:06,584 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] [2025-03-16 20:02:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:02:06,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:06,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1390405523, now seen corresponding path program 1 times [2025-03-16 20:02:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:06,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044192314] [2025-03-16 20:02:06,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:06,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:06,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:06,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044192314] [2025-03-16 20:02:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044192314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:06,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:06,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:02:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143939711] [2025-03-16 20:02:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:06,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:02:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:06,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:02:06,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:02:06,687 INFO L87 Difference]: Start difference. First operand 13839 states and 23214 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:07,471 INFO L93 Difference]: Finished difference Result 25678 states and 43033 transitions. [2025-03-16 20:02:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:07,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:07,524 INFO L225 Difference]: With dead ends: 25678 [2025-03-16 20:02:07,525 INFO L226 Difference]: Without dead ends: 13971 [2025-03-16 20:02:07,554 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-03-16 20:02:07,556 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 0 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12655 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:07,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12655 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13971 states. [2025-03-16 20:02:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13971 to 13971. [2025-03-16 20:02:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 12364 states have (on average 1.5982691685538661) internal successors, (19761), 12791 states have internal predecessors, (19761), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 20:02:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 23346 transitions. [2025-03-16 20:02:08,197 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 23346 transitions. Word has length 82 [2025-03-16 20:02:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:08,198 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 23346 transitions. [2025-03-16 20:02:08,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 23346 transitions. [2025-03-16 20:02:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:08,203 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] [2025-03-16 20:02:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:02:08,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash -621235508, now seen corresponding path program 1 times [2025-03-16 20:02:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:08,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230740491] [2025-03-16 20:02:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:08,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:08,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:08,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:08,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230740491] [2025-03-16 20:02:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230740491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:08,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:02:08,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70054573] [2025-03-16 20:02:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:02:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:08,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:02:08,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:02:08,277 INFO L87 Difference]: Start difference. First operand 13971 states and 23346 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:08,828 INFO L93 Difference]: Finished difference Result 25876 states and 43198 transitions. [2025-03-16 20:02:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:08,873 INFO L225 Difference]: With dead ends: 25876 [2025-03-16 20:02:08,873 INFO L226 Difference]: Without dead ends: 14037 [2025-03-16 20:02:08,894 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-03-16 20:02:08,895 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 0 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12655 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12655 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2025-03-16 20:02:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 14037. [2025-03-16 20:02:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14037 states, 12430 states have (on average 1.5924376508447304) internal successors, (19794), 12857 states have internal predecessors, (19794), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 20:02:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14037 states to 14037 states and 23379 transitions. [2025-03-16 20:02:09,646 INFO L78 Accepts]: Start accepts. Automaton has 14037 states and 23379 transitions. Word has length 82 [2025-03-16 20:02:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 14037 states and 23379 transitions. [2025-03-16 20:02:09,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-16 20:02:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14037 states and 23379 transitions. [2025-03-16 20:02:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:02:09,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:09,675 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] [2025-03-16 20:02:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:02:09,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1349703949, now seen corresponding path program 1 times [2025-03-16 20:02:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:09,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443845198] [2025-03-16 20:02:09,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:09,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:02:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:02:09,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:09,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:09,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:09,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443845198] [2025-03-16 20:02:09,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443845198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:09,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981009703] [2025-03-16 20:02:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:09,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:09,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:09,779 INFO L87 Difference]: Start difference. First operand 14037 states and 23379 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:11,963 INFO L93 Difference]: Finished difference Result 70642 states and 117782 transitions. [2025-03-16 20:02:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:02:11,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 20:02:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:12,217 INFO L225 Difference]: With dead ends: 70642 [2025-03-16 20:02:12,217 INFO L226 Difference]: Without dead ends: 58737 [2025-03-16 20:02:12,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:02:12,267 INFO L435 NwaCegarLoop]: 4418 mSDtfsCounter, 9079 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9079 SdHoareTripleChecker+Valid, 8993 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:12,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9079 Valid, 8993 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58737 states. [2025-03-16 20:02:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58737 to 58139. [2025-03-16 20:02:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58139 states, 50334 states have (on average 1.5365359399213256) internal successors, (77340), 52655 states have internal predecessors, (77340), 3703 states have call successors, (3703), 1981 states have call predecessors, (3703), 4100 states have return successors, (15062), 3534 states have call predecessors, (15062), 3701 states have call successors, (15062) [2025-03-16 20:02:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58139 states to 58139 states and 96105 transitions. [2025-03-16 20:02:15,477 INFO L78 Accepts]: Start accepts. Automaton has 58139 states and 96105 transitions. Word has length 82 [2025-03-16 20:02:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 58139 states and 96105 transitions. [2025-03-16 20:02:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-03-16 20:02:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 58139 states and 96105 transitions. [2025-03-16 20:02:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:15,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:15,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:02:15,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:02:15,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash -997779857, now seen corresponding path program 1 times [2025-03-16 20:02:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035515601] [2025-03-16 20:02:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:15,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:15,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:15,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 20:02:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035515601] [2025-03-16 20:02:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035515601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111062784] [2025-03-16 20:02:15,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:15,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:15,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:02:15,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:15,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:15,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:15,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:15,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:02:15,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 20:02:15,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111062784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:02:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712993189] [2025-03-16 20:02:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:15,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:15,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:15,844 INFO L87 Difference]: Start difference. First operand 58139 states and 96105 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-03-16 20:02:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:20,391 INFO L93 Difference]: Finished difference Result 168502 states and 280278 transitions. [2025-03-16 20:02:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 132 [2025-03-16 20:02:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:20,870 INFO L225 Difference]: With dead ends: 168502 [2025-03-16 20:02:20,870 INFO L226 Difference]: Without dead ends: 112495 [2025-03-16 20:02:21,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:21,011 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 4455 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-03-16 20:02:21,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 4455 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112495 states. [2025-03-16 20:02:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112495 to 112161. [2025-03-16 20:02:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112161 states, 96889 states have (on average 1.528223018092869) internal successors, (148068), 101528 states have internal predecessors, (148068), 7070 states have call successors, (7070), 3961 states have call predecessors, (7070), 8200 states have return successors, (29495), 6703 states have call predecessors, (29495), 7068 states have call successors, (29495) [2025-03-16 20:02:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112161 states to 112161 states and 184633 transitions. [2025-03-16 20:02:27,587 INFO L78 Accepts]: Start accepts. Automaton has 112161 states and 184633 transitions. Word has length 132 [2025-03-16 20:02:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 112161 states and 184633 transitions. [2025-03-16 20:02:27,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-03-16 20:02:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 112161 states and 184633 transitions. [2025-03-16 20:02:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:27,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:27,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:02:27,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:02:27,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 20:02:27,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 385982223, now seen corresponding path program 1 times [2025-03-16 20:02:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017869331] [2025-03-16 20:02:27,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:27,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:27,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:27,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 20:02:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017869331] [2025-03-16 20:02:27,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017869331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984774819] [2025-03-16 20:02:27,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:27,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:27,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:02:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:28,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:02:28,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:02:28,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984774819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:02:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675338856] [2025-03-16 20:02:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:28,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:28,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:28,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:28,083 INFO L87 Difference]: Start difference. First operand 112161 states and 184633 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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)