./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.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.08.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 15863afe4e938ca9562edf6cb3dc5bb7e439eb995cb0a1376182d98c80d63507 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:02:20,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:02:20,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:02:20,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:02:20,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:02:20,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:02:20,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:02:20,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:02:20,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:02:20,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:02:20,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:02:20,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:02:20,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:02:20,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:02:20,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:02:20,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:02:20,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:02:20,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:02:20,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:20,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:02:20,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:02:20,783 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 -> 15863afe4e938ca9562edf6cb3dc5bb7e439eb995cb0a1376182d98c80d63507 [2025-03-16 20:02:21,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:02:21,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:02:21,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:02:21,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:02:21,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:02:21,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-2.c [2025-03-16 20:02:22,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e755fcd/76bf5ba4165749f3a80762fc440b3f79/FLAG50e47b0a1 [2025-03-16 20:02:22,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:02:22,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-2.c [2025-03-16 20:02:22,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e755fcd/76bf5ba4165749f3a80762fc440b3f79/FLAG50e47b0a1 [2025-03-16 20:02:22,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e755fcd/76bf5ba4165749f3a80762fc440b3f79 [2025-03-16 20:02:22,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:02:22,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:02:22,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:22,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:02:22,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:02:22,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:22" (1/1) ... [2025-03-16 20:02:22,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a36a757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:22, skipping insertion in model container [2025-03-16 20:02:22,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:22" (1/1) ... [2025-03-16 20:02:22,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:02:24,053 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.08.cil-2.c[380323,380336] [2025-03-16 20:02:24,081 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.08.cil-2.c[383339,383352] [2025-03-16 20:02:24,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:24,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:02:24,727 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.08.cil-2.c[380323,380336] [2025-03-16 20:02:24,731 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.08.cil-2.c[383339,383352] [2025-03-16 20:02:24,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:24,816 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:02:24,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24 WrapperNode [2025-03-16 20:02:24,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:24,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:24,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:02:24,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:02:24,823 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:02:24" (1/1) ... [2025-03-16 20:02:24,871 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:02:24" (1/1) ... [2025-03-16 20:02:25,183 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-03-16 20:02:25,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:25,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:02:25,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:02:25,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:02:25,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,333 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:02:25,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:02:25,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:02:25,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:02:25,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:02:25,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (1/1) ... [2025-03-16 20:02:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:25,614 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:02:25,655 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:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:02:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:02:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:02:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:02:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:02:25,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:02:25,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:02:31,780 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:02:31,781 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:02:31,782 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:02:31,782 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:02:31,782 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:02:31,783 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:02:31,784 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:02:32,019 INFO L? ?]: Removed 1724 outVars from TransFormulas that were not future-live. [2025-03-16 20:02:32,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:02:32,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:02:32,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:02:32,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:32 BoogieIcfgContainer [2025-03-16 20:02:32,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:02:32,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:02:32,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:02:32,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:02:32,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:02:22" (1/3) ... [2025-03-16 20:02:32,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b811ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:32, skipping insertion in model container [2025-03-16 20:02:32,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:24" (2/3) ... [2025-03-16 20:02:32,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b811ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:32, skipping insertion in model container [2025-03-16 20:02:32,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:32" (3/3) ... [2025-03-16 20:02:32,073 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.08.cil-2.c [2025-03-16 20:02:32,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:02:32,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.08.cil-2.c that has 8 procedures, 2397 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 20:02:32,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:02:32,197 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;@576a62e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:02:32,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:02:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:02:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:32,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:32,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:32,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:32,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 798441018, now seen corresponding path program 1 times [2025-03-16 20:02:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537070461] [2025-03-16 20:02:32,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:32,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:32,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:32,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:32,526 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:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537070461] [2025-03-16 20:02:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537070461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:02:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754755060] [2025-03-16 20:02:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:32,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:32,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:02:32,555 INFO L87 Difference]: Start difference. First operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:32,697 INFO L93 Difference]: Finished difference Result 4789 states and 8929 transitions. [2025-03-16 20:02:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:02:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:32,721 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 20:02:32,721 INFO L226 Difference]: Without dead ends: 2390 [2025-03-16 20:02:32,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:02:32,730 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 427 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 8353 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:32,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2025-03-16 20:02:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2025-03-16 20:02:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2358 states have (on average 1.8401187446988974) internal successors, (4339), 2361 states have internal predecessors, (4339), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 20:02:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 4385 transitions. [2025-03-16 20:02:32,834 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 4385 transitions. Word has length 122 [2025-03-16 20:02:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:32,836 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 4385 transitions. [2025-03-16 20:02:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 4385 transitions. [2025-03-16 20:02:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:32,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:32,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:02:32,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1981458553, now seen corresponding path program 1 times [2025-03-16 20:02:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694771950] [2025-03-16 20:02:32,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:32,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:32,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:33,071 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:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694771950] [2025-03-16 20:02:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694771950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009413915] [2025-03-16 20:02:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:33,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:33,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:33,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:33,073 INFO L87 Difference]: Start difference. First operand 2390 states and 4385 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:33,550 INFO L93 Difference]: Finished difference Result 2933 states and 5258 transitions. [2025-03-16 20:02:33,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:02:33,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:33,564 INFO L225 Difference]: With dead ends: 2933 [2025-03-16 20:02:33,564 INFO L226 Difference]: Without dead ends: 2678 [2025-03-16 20:02:33,566 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:33,567 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4752 mSDsluCounter, 8769 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 13064 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:33,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 13064 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:02:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-16 20:02:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2655. [2025-03-16 20:02:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.819545979222778) internal successors, (4729), 2603 states have internal predecessors, (4729), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 20:02:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4810 transitions. [2025-03-16 20:02:33,634 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4810 transitions. Word has length 122 [2025-03-16 20:02:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4810 transitions. [2025-03-16 20:02:33,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4810 transitions. [2025-03-16 20:02:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:33,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:33,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:33,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:02:33,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash -303987751, now seen corresponding path program 1 times [2025-03-16 20:02:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:33,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853944213] [2025-03-16 20:02:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:33,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:33,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:33,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:33,899 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:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853944213] [2025-03-16 20:02:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853944213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:33,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:33,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646031646] [2025-03-16 20:02:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:33,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:33,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:33,901 INFO L87 Difference]: Start difference. First operand 2655 states and 4810 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:34,167 INFO L93 Difference]: Finished difference Result 3229 states and 5744 transitions. [2025-03-16 20:02:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:34,177 INFO L225 Difference]: With dead ends: 3229 [2025-03-16 20:02:34,177 INFO L226 Difference]: Without dead ends: 2709 [2025-03-16 20:02:34,179 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:34,180 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 4525 mSDsluCounter, 8451 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:34,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 12736 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-03-16 20:02:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2655. [2025-03-16 20:02:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.8187764524817238) internal successors, (4727), 2603 states have internal predecessors, (4727), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 20:02:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4808 transitions. [2025-03-16 20:02:34,240 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4808 transitions. Word has length 122 [2025-03-16 20:02:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:34,240 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4808 transitions. [2025-03-16 20:02:34,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4808 transitions. [2025-03-16 20:02:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:34,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:34,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:02:34,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 390659256, now seen corresponding path program 1 times [2025-03-16 20:02:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003584574] [2025-03-16 20:02:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:34,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:34,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:34,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:34,398 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:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003584574] [2025-03-16 20:02:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003584574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471097364] [2025-03-16 20:02:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:34,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:34,400 INFO L87 Difference]: Start difference. First operand 2655 states and 4808 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:34,946 INFO L93 Difference]: Finished difference Result 3511 states and 6189 transitions. [2025-03-16 20:02:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:34,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:34,957 INFO L225 Difference]: With dead ends: 3511 [2025-03-16 20:02:34,958 INFO L226 Difference]: Without dead ends: 2991 [2025-03-16 20:02:34,960 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:34,960 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 4745 mSDsluCounter, 13588 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 18112 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:34,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 18112 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:02:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2025-03-16 20:02:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2900. [2025-03-16 20:02:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2820 states have (on average 1.8) internal successors, (5076), 2825 states have internal predecessors, (5076), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 20:02:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5194 transitions. [2025-03-16 20:02:35,093 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5194 transitions. Word has length 122 [2025-03-16 20:02:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:35,094 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5194 transitions. [2025-03-16 20:02:35,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5194 transitions. [2025-03-16 20:02:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:35,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:35,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:35,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:02:35,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:35,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1521445881, now seen corresponding path program 1 times [2025-03-16 20:02:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950355503] [2025-03-16 20:02:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:35,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:35,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:35,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:35,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:35,366 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:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950355503] [2025-03-16 20:02:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950355503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064688496] [2025-03-16 20:02:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:35,369 INFO L87 Difference]: Start difference. First operand 2900 states and 5194 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:36,023 INFO L93 Difference]: Finished difference Result 4289 states and 7432 transitions. [2025-03-16 20:02:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:36,036 INFO L225 Difference]: With dead ends: 4289 [2025-03-16 20:02:36,037 INFO L226 Difference]: Without dead ends: 3524 [2025-03-16 20:02:36,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:02:36,041 INFO L435 NwaCegarLoop]: 4318 mSDtfsCounter, 4765 mSDsluCounter, 13099 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 17417 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:36,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 17417 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-03-16 20:02:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3421. [2025-03-16 20:02:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3291 states have (on average 1.7711941659070192) internal successors, (5829), 3300 states have internal predecessors, (5829), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 20:02:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 6027 transitions. [2025-03-16 20:02:36,138 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 6027 transitions. Word has length 122 [2025-03-16 20:02:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:36,138 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 6027 transitions. [2025-03-16 20:02:36,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 6027 transitions. [2025-03-16 20:02:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:36,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:36,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:36,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:02:36,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:36,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 588091544, now seen corresponding path program 1 times [2025-03-16 20:02:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922272820] [2025-03-16 20:02:36,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:36,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:36,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:36,269 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:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922272820] [2025-03-16 20:02:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922272820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367111537] [2025-03-16 20:02:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:36,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:36,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:36,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:36,272 INFO L87 Difference]: Start difference. First operand 3421 states and 6027 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:36,856 INFO L93 Difference]: Finished difference Result 5964 states and 10159 transitions. [2025-03-16 20:02:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:36,875 INFO L225 Difference]: With dead ends: 5964 [2025-03-16 20:02:36,876 INFO L226 Difference]: Without dead ends: 4678 [2025-03-16 20:02:36,880 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:36,882 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 4735 mSDsluCounter, 13567 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4751 SdHoareTripleChecker+Valid, 18084 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:36,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4751 Valid, 18084 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:02:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2025-03-16 20:02:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4550. [2025-03-16 20:02:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4314 states have (on average 1.7359758924432083) internal successors, (7489), 4337 states have internal predecessors, (7489), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 20:02:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 7871 transitions. [2025-03-16 20:02:37,031 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 7871 transitions. Word has length 122 [2025-03-16 20:02:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 7871 transitions. [2025-03-16 20:02:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 7871 transitions. [2025-03-16 20:02:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:37,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:37,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:37,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:02:37,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:37,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2082003993, now seen corresponding path program 1 times [2025-03-16 20:02:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830934802] [2025-03-16 20:02:37,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:37,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:37,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:37,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:37,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:37,144 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:37,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830934802] [2025-03-16 20:02:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830934802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299532080] [2025-03-16 20:02:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:37,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:37,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:37,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:37,146 INFO L87 Difference]: Start difference. First operand 4550 states and 7871 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:37,833 INFO L93 Difference]: Finished difference Result 9643 states and 16313 transitions. [2025-03-16 20:02:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:37,875 INFO L225 Difference]: With dead ends: 9643 [2025-03-16 20:02:37,875 INFO L226 Difference]: Without dead ends: 7228 [2025-03-16 20:02:37,882 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:37,883 INFO L435 NwaCegarLoop]: 4514 mSDtfsCounter, 4730 mSDsluCounter, 13558 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 18072 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:37,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 18072 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2025-03-16 20:02:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 7051. [2025-03-16 20:02:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 6585 states have (on average 1.7064540622627182) internal successors, (11237), 6654 states have internal predecessors, (11237), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 20:02:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 12083 transitions. [2025-03-16 20:02:38,094 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 12083 transitions. Word has length 122 [2025-03-16 20:02:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 7051 states and 12083 transitions. [2025-03-16 20:02:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 12083 transitions. [2025-03-16 20:02:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:38,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:38,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:38,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:02:38,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:38,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash 883268728, now seen corresponding path program 1 times [2025-03-16 20:02:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433592025] [2025-03-16 20:02:38,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:38,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:38,240 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:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433592025] [2025-03-16 20:02:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433592025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:38,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478988719] [2025-03-16 20:02:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:38,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:38,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:38,244 INFO L87 Difference]: Start difference. First operand 7051 states and 12083 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:39,165 INFO L93 Difference]: Finished difference Result 17914 states and 30699 transitions. [2025-03-16 20:02:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:39,213 INFO L225 Difference]: With dead ends: 17914 [2025-03-16 20:02:39,213 INFO L226 Difference]: Without dead ends: 12998 [2025-03-16 20:02:39,233 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:39,233 INFO L435 NwaCegarLoop]: 4511 mSDtfsCounter, 4725 mSDsluCounter, 13549 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 18060 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:39,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 18060 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:02:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12998 states. [2025-03-16 20:02:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12998 to 12728. [2025-03-16 20:02:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6950119169220292) internal successors, (19913), 11963 states have internal predecessors, (19913), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:02:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22071 transitions. [2025-03-16 20:02:39,630 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22071 transitions. Word has length 122 [2025-03-16 20:02:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22071 transitions. [2025-03-16 20:02:39,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22071 transitions. [2025-03-16 20:02:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:39,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:39,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:39,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:02:39,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:39,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1398789177, now seen corresponding path program 1 times [2025-03-16 20:02:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198730038] [2025-03-16 20:02:39,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:39,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:39,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:39,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:39,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:39,727 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:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198730038] [2025-03-16 20:02:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198730038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270531932] [2025-03-16 20:02:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:39,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:39,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:39,728 INFO L87 Difference]: Start difference. First operand 12728 states and 22071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:40,237 INFO L93 Difference]: Finished difference Result 26261 states and 46397 transitions. [2025-03-16 20:02:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:40,288 INFO L225 Difference]: With dead ends: 26261 [2025-03-16 20:02:40,288 INFO L226 Difference]: Without dead ends: 15668 [2025-03-16 20:02:40,320 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:40,322 INFO L435 NwaCegarLoop]: 4272 mSDtfsCounter, 4517 mSDsluCounter, 8426 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 12698 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15668 states. [2025-03-16 20:02:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15668 to 12728. [2025-03-16 20:02:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6922029281579842) internal successors, (19880), 11963 states have internal predecessors, (19880), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:02:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22038 transitions. [2025-03-16 20:02:41,036 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22038 transitions. Word has length 122 [2025-03-16 20:02:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:41,037 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22038 transitions. [2025-03-16 20:02:41,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22038 transitions. [2025-03-16 20:02:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:41,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:41,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:41,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:02:41,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 445587544, now seen corresponding path program 1 times [2025-03-16 20:02:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376282960] [2025-03-16 20:02:41,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:41,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:41,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:41,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:41,124 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:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376282960] [2025-03-16 20:02:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376282960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:41,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125726717] [2025-03-16 20:02:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:41,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:41,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:41,126 INFO L87 Difference]: Start difference. First operand 12728 states and 22038 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:41,675 INFO L93 Difference]: Finished difference Result 26016 states and 45841 transitions. [2025-03-16 20:02:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:41,733 INFO L225 Difference]: With dead ends: 26016 [2025-03-16 20:02:41,734 INFO L226 Difference]: Without dead ends: 15423 [2025-03-16 20:02:41,766 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:41,767 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4514 mSDsluCounter, 8421 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4530 SdHoareTripleChecker+Valid, 12690 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:41,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4530 Valid, 12690 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15423 states. [2025-03-16 20:02:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15423 to 12728. [2025-03-16 20:02:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6893939393939394) internal successors, (19847), 11963 states have internal predecessors, (19847), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:02:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22005 transitions. [2025-03-16 20:02:42,360 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22005 transitions. Word has length 122 [2025-03-16 20:02:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22005 transitions. [2025-03-16 20:02:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22005 transitions. [2025-03-16 20:02:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:42,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:42,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:42,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:02:42,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:42,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1246123097, now seen corresponding path program 1 times [2025-03-16 20:02:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642532751] [2025-03-16 20:02:42,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:42,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:42,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:42,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:42,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:42,512 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:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642532751] [2025-03-16 20:02:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642532751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:42,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196284955] [2025-03-16 20:02:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:42,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:42,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:42,514 INFO L87 Difference]: Start difference. First operand 12728 states and 22005 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:43,692 INFO L93 Difference]: Finished difference Result 38089 states and 67148 transitions. [2025-03-16 20:02:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:43,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:43,789 INFO L225 Difference]: With dead ends: 38089 [2025-03-16 20:02:43,789 INFO L226 Difference]: Without dead ends: 27496 [2025-03-16 20:02:43,813 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:43,814 INFO L435 NwaCegarLoop]: 4496 mSDtfsCounter, 4931 mSDsluCounter, 13501 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:43,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 17997 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27496 states. [2025-03-16 20:02:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27496 to 25363. [2025-03-16 20:02:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6931324004305706) internal successors, (39323), 23894 states have internal predecessors, (39323), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 20:02:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45577 transitions. [2025-03-16 20:02:45,078 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45577 transitions. Word has length 122 [2025-03-16 20:02:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:45,079 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45577 transitions. [2025-03-16 20:02:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45577 transitions. [2025-03-16 20:02:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:45,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:45,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:45,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:02:45,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 717757496, now seen corresponding path program 1 times [2025-03-16 20:02:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481007851] [2025-03-16 20:02:45,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:45,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:45,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:45,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481007851] [2025-03-16 20:02:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481007851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791213745] [2025-03-16 20:02:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:45,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:45,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:45,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:45,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:45,170 INFO L87 Difference]: Start difference. First operand 25363 states and 45577 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:46,409 INFO L93 Difference]: Finished difference Result 55170 states and 102365 transitions. [2025-03-16 20:02:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:46,642 INFO L225 Difference]: With dead ends: 55170 [2025-03-16 20:02:46,642 INFO L226 Difference]: Without dead ends: 31942 [2025-03-16 20:02:46,731 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:46,732 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4508 mSDsluCounter, 8410 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12674 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:46,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12674 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31942 states. [2025-03-16 20:02:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31942 to 25363. [2025-03-16 20:02:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6903336921420882) internal successors, (39258), 23894 states have internal predecessors, (39258), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 20:02:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45512 transitions. [2025-03-16 20:02:47,954 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45512 transitions. Word has length 122 [2025-03-16 20:02:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45512 transitions. [2025-03-16 20:02:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45512 transitions. [2025-03-16 20:02:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:47,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:47,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:47,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:02:47,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:47,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1393450105, now seen corresponding path program 1 times [2025-03-16 20:02:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505936382] [2025-03-16 20:02:47,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:47,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:47,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:47,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:47,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:48,053 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:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:48,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505936382] [2025-03-16 20:02:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505936382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531735062] [2025-03-16 20:02:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:48,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:48,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:48,054 INFO L87 Difference]: Start difference. First operand 25363 states and 45512 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:50,510 INFO L93 Difference]: Finished difference Result 80478 states and 151003 transitions. [2025-03-16 20:02:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:50,814 INFO L225 Difference]: With dead ends: 80478 [2025-03-16 20:02:50,814 INFO L226 Difference]: Without dead ends: 57250 [2025-03-16 20:02:50,888 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:50,889 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4900 mSDsluCounter, 13033 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 17333 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:50,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 17333 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57250 states. [2025-03-16 20:02:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57250 to 53939. [2025-03-16 20:02:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.7008831147641288) internal successors, (83396), 51094 states have internal predecessors, (83396), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:02:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103922 transitions. [2025-03-16 20:02:54,032 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103922 transitions. Word has length 122 [2025-03-16 20:02:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103922 transitions. [2025-03-16 20:02:54,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103922 transitions. [2025-03-16 20:02:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:02:54,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:54,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:54,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:02:54,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash 583962648, now seen corresponding path program 1 times [2025-03-16 20:02:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765387353] [2025-03-16 20:02:54,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:54,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:02:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:02:54,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:54,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:54,181 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:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:54,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765387353] [2025-03-16 20:02:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765387353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:54,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723803184] [2025-03-16 20:02:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:54,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:54,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:54,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:54,183 INFO L87 Difference]: Start difference. First operand 53939 states and 103922 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:57,015 INFO L93 Difference]: Finished difference Result 121066 states and 244585 transitions. [2025-03-16 20:02:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:02:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:57,311 INFO L225 Difference]: With dead ends: 121066 [2025-03-16 20:02:57,312 INFO L226 Difference]: Without dead ends: 69262 [2025-03-16 20:02:57,426 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:57,426 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 4504 mSDsluCounter, 8401 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12660 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69262 states. [2025-03-16 20:03:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69262 to 53939. [2025-03-16 20:03:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6982521262058698) internal successors, (83267), 51094 states have internal predecessors, (83267), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:03:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103793 transitions. [2025-03-16 20:03:01,364 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103793 transitions. Word has length 122 [2025-03-16 20:03:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:01,365 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103793 transitions. [2025-03-16 20:03:01,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:03:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103793 transitions. [2025-03-16 20:03:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:03:01,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:01,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:01,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:03:01,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:01,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 142208153, now seen corresponding path program 1 times [2025-03-16 20:03:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765716197] [2025-03-16 20:03:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:01,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:03:01,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:03:01,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:01,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:01,489 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:03:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765716197] [2025-03-16 20:03:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765716197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071263554] [2025-03-16 20:03:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:01,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:01,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:01,491 INFO L87 Difference]: Start difference. First operand 53939 states and 103793 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:03:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:04,579 INFO L93 Difference]: Finished difference Result 118877 states and 239949 transitions. [2025-03-16 20:03:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:03:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:04,991 INFO L225 Difference]: With dead ends: 118877 [2025-03-16 20:03:04,991 INFO L226 Difference]: Without dead ends: 67073 [2025-03-16 20:03:05,089 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:03:05,090 INFO L435 NwaCegarLoop]: 4256 mSDtfsCounter, 4501 mSDsluCounter, 8396 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:05,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12652 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67073 states. [2025-03-16 20:03:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67073 to 53939. [2025-03-16 20:03:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6956211376476107) internal successors, (83138), 51094 states have internal predecessors, (83138), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:03:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103664 transitions. [2025-03-16 20:03:09,123 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103664 transitions. Word has length 122 [2025-03-16 20:03:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103664 transitions. [2025-03-16 20:03:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:03:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103664 transitions. [2025-03-16 20:03:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:03:09,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:09,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:03:09,138 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash 127958008, now seen corresponding path program 1 times [2025-03-16 20:03:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021560703] [2025-03-16 20:03:09,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:09,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:03:09,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:03:09,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:09,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:09,212 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:03:09,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:09,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021560703] [2025-03-16 20:03:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021560703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639269790] [2025-03-16 20:03:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:09,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:09,215 INFO L87 Difference]: Start difference. First operand 53939 states and 103664 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:03:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:14,045 INFO L93 Difference]: Finished difference Result 171684 states and 356713 transitions. [2025-03-16 20:03:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:03:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:14,717 INFO L225 Difference]: With dead ends: 171684 [2025-03-16 20:03:14,717 INFO L226 Difference]: Without dead ends: 119880 [2025-03-16 20:03:14,937 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:03:14,938 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4762 mSDsluCounter, 13441 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 17916 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 17916 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:03:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119880 states.