./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label40+token_ring.04.cil-1.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 f360dda009e25a73435ad605bf6b2f1b0f95e4925e3a6f627d3b33f05412514d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:47:00,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:47:01,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:47:01,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:47:01,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:47:01,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:47:01,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:47:01,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:47:01,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:47:01,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:47:01,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:47:01,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:47:01,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:47:01,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:47:01,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:47:01,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:47:01,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:47:01,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:47:01,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:47:01,052 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 -> f360dda009e25a73435ad605bf6b2f1b0f95e4925e3a6f627d3b33f05412514d [2025-03-08 06:47:01,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:47:01,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:47:01,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:47:01,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:47:01,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:47:01,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.04.cil-1.c [2025-03-08 06:47:02,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9daa6b566/8174256b67f34ccea5e75401f67ffc43/FLAGde325b738 [2025-03-08 06:47:02,872 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:47:02,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.04.cil-1.c [2025-03-08 06:47:02,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9daa6b566/8174256b67f34ccea5e75401f67ffc43/FLAGde325b738 [2025-03-08 06:47:02,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9daa6b566/8174256b67f34ccea5e75401f67ffc43 [2025-03-08 06:47:02,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:47:02,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:47:02,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:47:02,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:47:02,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:47:02,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:47:02" (1/1) ... [2025-03-08 06:47:02,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473af5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:02, skipping insertion in model container [2025-03-08 06:47:02,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:47:02" (1/1) ... [2025-03-08 06:47:03,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:47:04,060 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_label40+token_ring.04.cil-1.c[377069,377082] [2025-03-08 06:47:04,088 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_label40+token_ring.04.cil-1.c[383339,383352] [2025-03-08 06:47:04,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:47:04,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:47:04,824 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_label40+token_ring.04.cil-1.c[377069,377082] [2025-03-08 06:47:04,829 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_label40+token_ring.04.cil-1.c[383339,383352] [2025-03-08 06:47:04,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:47:04,880 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:47:04,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04 WrapperNode [2025-03-08 06:47:04,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:47:04,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:47:04,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:47:04,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:47:04,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:04,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,248 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-03-08 06:47:05,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:47:05,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:47:05,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:47:05,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:47:05,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,354 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-08 06:47:05,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:47:05,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:47:05,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:47:05,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:47:05,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (1/1) ... [2025-03-08 06:47:05,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:47:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:47:05,722 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-08 06:47:05,724 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-08 06:47:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:47:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:47:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:47:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:47:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:47:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:47:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:47:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:47:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:47:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:47:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:47:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:47:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:47:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:47:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:47:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:47:05,842 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:47:05,843 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:47:11,779 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:47:11,780 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:47:11,780 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:47:11,780 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:47:11,781 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:47:11,781 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:47:11,781 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:47:11,944 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2025-03-08 06:47:11,945 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:47:12,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:47:12,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:47:12,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:47:12 BoogieIcfgContainer [2025-03-08 06:47:12,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:47:12,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:47:12,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:47:12,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:47:12,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:47:02" (1/3) ... [2025-03-08 06:47:12,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754af056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:47:12, skipping insertion in model container [2025-03-08 06:47:12,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:47:04" (2/3) ... [2025-03-08 06:47:12,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754af056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:47:12, skipping insertion in model container [2025-03-08 06:47:12,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:47:12" (3/3) ... [2025-03-08 06:47:12,011 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.04.cil-1.c [2025-03-08 06:47:12,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:47:12,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.04.cil-1.c that has 7 procedures, 2363 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-08 06:47:12,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:47:12,126 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;@29099b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:47:12,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:47:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 2363 states, 2337 states have (on average 1.85066324347454) internal successors, (4325), 2339 states have internal predecessors, (4325), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 06:47:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:12,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:12,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] [2025-03-08 06:47:12,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1871579824, now seen corresponding path program 1 times [2025-03-08 06:47:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:12,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462578679] [2025-03-08 06:47:12,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:12,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:12,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:12,557 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-08 06:47:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462578679] [2025-03-08 06:47:12,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462578679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:12,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:12,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:47:12,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50591300] [2025-03-08 06:47:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:12,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:47:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:47:12,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:47:12,586 INFO L87 Difference]: Start difference. First operand has 2363 states, 2337 states have (on average 1.85066324347454) internal successors, (4325), 2339 states have internal predecessors, (4325), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:13,053 INFO L93 Difference]: Finished difference Result 4896 states and 8993 transitions. [2025-03-08 06:47:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:47:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:13,076 INFO L225 Difference]: With dead ends: 4896 [2025-03-08 06:47:13,076 INFO L226 Difference]: Without dead ends: 2475 [2025-03-08 06:47:13,085 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-08 06:47:13,088 INFO L435 NwaCegarLoop]: 4232 mSDtfsCounter, 4494 mSDsluCounter, 8563 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4506 SdHoareTripleChecker+Valid, 12795 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:13,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4506 Valid, 12795 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:47:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-03-08 06:47:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2462. [2025-03-08 06:47:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2416 states have (on average 1.8265728476821192) internal successors, (4413), 2419 states have internal predecessors, (4413), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-08 06:47:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4476 transitions. [2025-03-08 06:47:13,225 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4476 transitions. Word has length 88 [2025-03-08 06:47:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:13,225 INFO L471 AbstractCegarLoop]: Abstraction has 2462 states and 4476 transitions. [2025-03-08 06:47:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4476 transitions. [2025-03-08 06:47:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:13,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:13,229 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] [2025-03-08 06:47:13,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:47:13,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:13,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1865487086, now seen corresponding path program 1 times [2025-03-08 06:47:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173335831] [2025-03-08 06:47:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:13,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:13,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:13,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:13,390 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-08 06:47:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173335831] [2025-03-08 06:47:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173335831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:47:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156994407] [2025-03-08 06:47:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:13,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:47:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:13,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:47:13,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:47:13,393 INFO L87 Difference]: Start difference. First operand 2462 states and 4476 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:13,638 INFO L93 Difference]: Finished difference Result 2821 states and 5033 transitions. [2025-03-08 06:47:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:47:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:13,649 INFO L225 Difference]: With dead ends: 2821 [2025-03-08 06:47:13,650 INFO L226 Difference]: Without dead ends: 2492 [2025-03-08 06:47:13,651 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-08 06:47:13,652 INFO L435 NwaCegarLoop]: 4151 mSDtfsCounter, 4297 mSDsluCounter, 8227 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 12378 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 12378 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:47:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-08 06:47:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2462. [2025-03-08 06:47:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2416 states have (on average 1.8257450331125828) internal successors, (4411), 2419 states have internal predecessors, (4411), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-08 06:47:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4474 transitions. [2025-03-08 06:47:13,710 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4474 transitions. Word has length 88 [2025-03-08 06:47:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:13,711 INFO L471 AbstractCegarLoop]: Abstraction has 2462 states and 4474 transitions. [2025-03-08 06:47:13,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4474 transitions. [2025-03-08 06:47:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:13,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:13,715 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] [2025-03-08 06:47:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:47:13,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 320446961, now seen corresponding path program 1 times [2025-03-08 06:47:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621264371] [2025-03-08 06:47:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:13,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:13,873 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-08 06:47:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:13,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621264371] [2025-03-08 06:47:13,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621264371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:13,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:13,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:47:13,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478020976] [2025-03-08 06:47:13,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:13,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:47:13,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:13,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:47:13,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:13,875 INFO L87 Difference]: Start difference. First operand 2462 states and 4474 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:14,598 INFO L93 Difference]: Finished difference Result 2994 states and 5288 transitions. [2025-03-08 06:47:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:47:14,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:14,609 INFO L225 Difference]: With dead ends: 2994 [2025-03-08 06:47:14,609 INFO L226 Difference]: Without dead ends: 2665 [2025-03-08 06:47:14,611 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-08 06:47:14,613 INFO L435 NwaCegarLoop]: 4288 mSDtfsCounter, 4413 mSDsluCounter, 12847 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 17135 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:14,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 17135 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:47:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-03-08 06:47:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2616. [2025-03-08 06:47:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2550 states have (on average 1.8086274509803921) internal successors, (4612), 2554 states have internal predecessors, (4612), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 06:47:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 4704 transitions. [2025-03-08 06:47:14,682 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 4704 transitions. Word has length 88 [2025-03-08 06:47:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 2616 states and 4704 transitions. [2025-03-08 06:47:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 4704 transitions. [2025-03-08 06:47:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:14,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:14,687 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] [2025-03-08 06:47:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:47:14,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -163228366, now seen corresponding path program 1 times [2025-03-08 06:47:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57646806] [2025-03-08 06:47:14,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:14,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:14,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:14,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:14,819 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-08 06:47:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57646806] [2025-03-08 06:47:14,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57646806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:14,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:14,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:47:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712870106] [2025-03-08 06:47:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:47:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:14,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:47:14,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:14,821 INFO L87 Difference]: Start difference. First operand 2616 states and 4704 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:15,233 INFO L93 Difference]: Finished difference Result 3475 states and 6015 transitions. [2025-03-08 06:47:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:47:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:15,245 INFO L225 Difference]: With dead ends: 3475 [2025-03-08 06:47:15,246 INFO L226 Difference]: Without dead ends: 2992 [2025-03-08 06:47:15,248 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-08 06:47:15,249 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4408 mSDsluCounter, 12835 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 17119 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:15,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 17119 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:47:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2025-03-08 06:47:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2939. [2025-03-08 06:47:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2831 states have (on average 1.7792299540798304) internal successors, (5037), 2839 states have internal predecessors, (5037), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-08 06:47:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 5193 transitions. [2025-03-08 06:47:15,316 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 5193 transitions. Word has length 88 [2025-03-08 06:47:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:15,317 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 5193 transitions. [2025-03-08 06:47:15,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 5193 transitions. [2025-03-08 06:47:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:15,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:15,319 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] [2025-03-08 06:47:15,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:47:15,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:15,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 791000529, now seen corresponding path program 1 times [2025-03-08 06:47:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:15,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637861520] [2025-03-08 06:47:15,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:15,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:15,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:15,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:15,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:15,412 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-08 06:47:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637861520] [2025-03-08 06:47:15,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637861520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:15,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:15,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:47:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433969562] [2025-03-08 06:47:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:15,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:47:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:15,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:47:15,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:15,415 INFO L87 Difference]: Start difference. First operand 2939 states and 5193 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:15,861 INFO L93 Difference]: Finished difference Result 4492 states and 7582 transitions. [2025-03-08 06:47:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:47:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:15,874 INFO L225 Difference]: With dead ends: 4492 [2025-03-08 06:47:15,874 INFO L226 Difference]: Without dead ends: 3686 [2025-03-08 06:47:15,877 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-08 06:47:15,878 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4403 mSDsluCounter, 12826 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4415 SdHoareTripleChecker+Valid, 17107 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:15,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4415 Valid, 17107 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:47:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2025-03-08 06:47:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3624. [2025-03-08 06:47:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3426 states have (on average 1.7352597781669585) internal successors, (5945), 3448 states have internal predecessors, (5945), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-08 06:47:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 6253 transitions. [2025-03-08 06:47:15,966 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 6253 transitions. Word has length 88 [2025-03-08 06:47:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 3624 states and 6253 transitions. [2025-03-08 06:47:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 6253 transitions. [2025-03-08 06:47:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:15,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:15,969 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] [2025-03-08 06:47:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:47:15,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 544687442, now seen corresponding path program 1 times [2025-03-08 06:47:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513248783] [2025-03-08 06:47:15,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:15,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:15,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:15,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:16,061 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-08 06:47:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513248783] [2025-03-08 06:47:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513248783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:47:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125988144] [2025-03-08 06:47:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:47:16,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:47:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:16,063 INFO L87 Difference]: Start difference. First operand 3624 states and 6253 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:16,565 INFO L93 Difference]: Finished difference Result 6927 states and 11425 transitions. [2025-03-08 06:47:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:47:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:16,583 INFO L225 Difference]: With dead ends: 6927 [2025-03-08 06:47:16,583 INFO L226 Difference]: Without dead ends: 5436 [2025-03-08 06:47:16,589 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-08 06:47:16,589 INFO L435 NwaCegarLoop]: 4276 mSDtfsCounter, 4532 mSDsluCounter, 12806 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4549 SdHoareTripleChecker+Valid, 17082 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:16,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4549 Valid, 17082 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:47:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2025-03-08 06:47:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5069. [2025-03-08 06:47:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4681 states have (on average 1.6844691305276651) internal successors, (7885), 4749 states have internal predecessors, (7885), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-08 06:47:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8577 transitions. [2025-03-08 06:47:16,755 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8577 transitions. Word has length 88 [2025-03-08 06:47:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8577 transitions. [2025-03-08 06:47:16,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8577 transitions. [2025-03-08 06:47:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:16,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:16,758 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] [2025-03-08 06:47:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:47:16,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1125826127, now seen corresponding path program 1 times [2025-03-08 06:47:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735561458] [2025-03-08 06:47:16,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:16,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:16,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:16,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:16,821 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-08 06:47:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735561458] [2025-03-08 06:47:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735561458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:47:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796374917] [2025-03-08 06:47:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:47:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:47:16,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:47:16,823 INFO L87 Difference]: Start difference. First operand 5069 states and 8577 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:17,060 INFO L93 Difference]: Finished difference Result 8420 states and 14050 transitions. [2025-03-08 06:47:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:47:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:17,089 INFO L225 Difference]: With dead ends: 8420 [2025-03-08 06:47:17,089 INFO L226 Difference]: Without dead ends: 5484 [2025-03-08 06:47:17,097 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-08 06:47:17,098 INFO L435 NwaCegarLoop]: 4131 mSDtfsCounter, 4295 mSDsluCounter, 8195 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 12326 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:17,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 12326 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:47:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2025-03-08 06:47:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5069. [2025-03-08 06:47:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4681 states have (on average 1.6808374279000213) internal successors, (7868), 4749 states have internal predecessors, (7868), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-08 06:47:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8560 transitions. [2025-03-08 06:47:17,319 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8560 transitions. Word has length 88 [2025-03-08 06:47:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8560 transitions. [2025-03-08 06:47:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8560 transitions. [2025-03-08 06:47:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:17,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:17,329 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] [2025-03-08 06:47:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:47:17,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1733902990, now seen corresponding path program 1 times [2025-03-08 06:47:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481412880] [2025-03-08 06:47:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:17,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:17,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:17,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:17,572 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-08 06:47:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481412880] [2025-03-08 06:47:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481412880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:47:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592645950] [2025-03-08 06:47:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:17,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:47:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:17,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:47:17,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:17,578 INFO L87 Difference]: Start difference. First operand 5069 states and 8560 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:18,119 INFO L93 Difference]: Finished difference Result 11474 states and 18968 transitions. [2025-03-08 06:47:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:47:18,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:18,141 INFO L225 Difference]: With dead ends: 11474 [2025-03-08 06:47:18,141 INFO L226 Difference]: Without dead ends: 8538 [2025-03-08 06:47:18,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-08 06:47:18,148 INFO L435 NwaCegarLoop]: 4268 mSDtfsCounter, 4459 mSDsluCounter, 12783 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 17051 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:18,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 17051 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:47:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2025-03-08 06:47:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 8097. [2025-03-08 06:47:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 7283 states have (on average 1.6298228751887958) internal successors, (11870), 7497 states have internal predecessors, (11870), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-08 06:47:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 13698 transitions. [2025-03-08 06:47:18,437 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 13698 transitions. Word has length 88 [2025-03-08 06:47:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:18,438 INFO L471 AbstractCegarLoop]: Abstraction has 8097 states and 13698 transitions. [2025-03-08 06:47:18,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 13698 transitions. [2025-03-08 06:47:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:18,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:18,443 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] [2025-03-08 06:47:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:47:18,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:18,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash 47596945, now seen corresponding path program 1 times [2025-03-08 06:47:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156460698] [2025-03-08 06:47:18,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:18,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:18,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:18,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:18,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:18,499 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-08 06:47:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156460698] [2025-03-08 06:47:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156460698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:47:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059720889] [2025-03-08 06:47:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:47:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:47:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:47:18,500 INFO L87 Difference]: Start difference. First operand 8097 states and 13698 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:18,962 INFO L93 Difference]: Finished difference Result 14796 states and 25246 transitions. [2025-03-08 06:47:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:47:18,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:19,026 INFO L225 Difference]: With dead ends: 14796 [2025-03-08 06:47:19,030 INFO L226 Difference]: Without dead ends: 8832 [2025-03-08 06:47:19,055 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-08 06:47:19,059 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 4284 mSDsluCounter, 8195 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 12330 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:19,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 12330 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:47:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8832 states. [2025-03-08 06:47:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8832 to 8097. [2025-03-08 06:47:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 7283 states have (on average 1.6252917753672937) internal successors, (11837), 7497 states have internal predecessors, (11837), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-08 06:47:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 13665 transitions. [2025-03-08 06:47:19,445 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 13665 transitions. Word has length 88 [2025-03-08 06:47:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:19,445 INFO L471 AbstractCegarLoop]: Abstraction has 8097 states and 13665 transitions. [2025-03-08 06:47:19,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 13665 transitions. [2025-03-08 06:47:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:19,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:19,468 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] [2025-03-08 06:47:19,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:47:19,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1351990674, now seen corresponding path program 1 times [2025-03-08 06:47:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158079691] [2025-03-08 06:47:19,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:19,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:19,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:19,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:19,518 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-08 06:47:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158079691] [2025-03-08 06:47:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158079691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:47:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549809134] [2025-03-08 06:47:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:47:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:47:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:47:19,520 INFO L87 Difference]: Start difference. First operand 8097 states and 13665 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:19,920 INFO L93 Difference]: Finished difference Result 14551 states and 24690 transitions. [2025-03-08 06:47:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:47:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:19,941 INFO L225 Difference]: With dead ends: 14551 [2025-03-08 06:47:19,941 INFO L226 Difference]: Without dead ends: 8587 [2025-03-08 06:47:19,950 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-08 06:47:19,950 INFO L435 NwaCegarLoop]: 4132 mSDtfsCounter, 4281 mSDsluCounter, 8190 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4293 SdHoareTripleChecker+Valid, 12322 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:19,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4293 Valid, 12322 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:47:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2025-03-08 06:47:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 8097. [2025-03-08 06:47:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 7283 states have (on average 1.6207606755457915) internal successors, (11804), 7497 states have internal predecessors, (11804), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-08 06:47:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 13632 transitions. [2025-03-08 06:47:20,201 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 13632 transitions. Word has length 88 [2025-03-08 06:47:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 8097 states and 13632 transitions. [2025-03-08 06:47:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 13632 transitions. [2025-03-08 06:47:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:47:20,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:20,206 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] [2025-03-08 06:47:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:47:20,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -822689423, now seen corresponding path program 1 times [2025-03-08 06:47:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259858627] [2025-03-08 06:47:20,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:47:20,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:47:20,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:20,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:20,274 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-08 06:47:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259858627] [2025-03-08 06:47:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259858627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:47:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:47:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534308593] [2025-03-08 06:47:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:47:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:20,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:47:20,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:47:20,276 INFO L87 Difference]: Start difference. First operand 8097 states and 13632 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:20,932 INFO L93 Difference]: Finished difference Result 19888 states and 33074 transitions. [2025-03-08 06:47:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:47:20,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 06:47:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:20,968 INFO L225 Difference]: With dead ends: 19888 [2025-03-08 06:47:20,969 INFO L226 Difference]: Without dead ends: 13925 [2025-03-08 06:47:20,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:47:20,984 INFO L435 NwaCegarLoop]: 4439 mSDtfsCounter, 4399 mSDsluCounter, 4372 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4399 SdHoareTripleChecker+Valid, 8811 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:20,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4399 Valid, 8811 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:47:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13925 states. [2025-03-08 06:47:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13925 to 13892. [2025-03-08 06:47:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13892 states, 12270 states have (on average 1.56519967400163) internal successors, (19205), 12729 states have internal predecessors, (19205), 800 states have call successors, (800), 396 states have call predecessors, (800), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-03-08 06:47:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 22822 transitions. [2025-03-08 06:47:21,603 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 22822 transitions. Word has length 88 [2025-03-08 06:47:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:21,603 INFO L471 AbstractCegarLoop]: Abstraction has 13892 states and 22822 transitions. [2025-03-08 06:47:21,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:47:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 22822 transitions. [2025-03-08 06:47:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:47:21,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:21,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:47:21,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:47:21,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:21,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -846010141, now seen corresponding path program 1 times [2025-03-08 06:47:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813011699] [2025-03-08 06:47:21,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:21,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:21,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:21,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:47:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813011699] [2025-03-08 06:47:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813011699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:47:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983670584] [2025-03-08 06:47:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:47:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:47:21,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:47:21,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:47:21,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:21,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:21,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:21,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:21,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:47:21,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:47:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:47:21,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:47:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983670584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:47:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:47:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439520583] [2025-03-08 06:47:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:47:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:21,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:47:21,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:21,877 INFO L87 Difference]: Start difference. First operand 13892 states and 22822 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:22,843 INFO L93 Difference]: Finished difference Result 37077 states and 60348 transitions. [2025-03-08 06:47:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:47:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 143 [2025-03-08 06:47:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:22,925 INFO L225 Difference]: With dead ends: 37077 [2025-03-08 06:47:22,925 INFO L226 Difference]: Without dead ends: 25319 [2025-03-08 06:47:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:22,952 INFO L435 NwaCegarLoop]: 4214 mSDtfsCounter, 4167 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:22,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 4444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:47:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25319 states. [2025-03-08 06:47:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25319 to 25251. [2025-03-08 06:47:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25251 states, 22079 states have (on average 1.5357579600525386) internal successors, (33908), 22995 states have internal predecessors, (33908), 1530 states have call successors, (1530), 792 states have call predecessors, (1530), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-03-08 06:47:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25251 states to 25251 states and 40971 transitions. [2025-03-08 06:47:23,955 INFO L78 Accepts]: Start accepts. Automaton has 25251 states and 40971 transitions. Word has length 143 [2025-03-08 06:47:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 25251 states and 40971 transitions. [2025-03-08 06:47:23,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25251 states and 40971 transitions. [2025-03-08 06:47:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:47:23,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:23,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:47:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:47:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 06:47:24,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -771795555, now seen corresponding path program 1 times [2025-03-08 06:47:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017298009] [2025-03-08 06:47:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:24,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:24,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:24,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:47:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017298009] [2025-03-08 06:47:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017298009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:47:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482539774] [2025-03-08 06:47:24,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:47:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:47:24,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:47:24,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:47:24,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:24,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:24,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:24,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:24,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:47:24,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:47:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:47:24,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:47:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482539774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:47:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:47:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261506363] [2025-03-08 06:47:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:24,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:47:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:24,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:47:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:24,406 INFO L87 Difference]: Start difference. First operand 25251 states and 40971 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:26,565 INFO L93 Difference]: Finished difference Result 70824 states and 114601 transitions. [2025-03-08 06:47:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:47:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 143 [2025-03-08 06:47:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:26,720 INFO L225 Difference]: With dead ends: 70824 [2025-03-08 06:47:26,720 INFO L226 Difference]: Without dead ends: 47707 [2025-03-08 06:47:26,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:26,766 INFO L435 NwaCegarLoop]: 4214 mSDtfsCounter, 4161 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4161 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:26,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4161 Valid, 4444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:47:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47707 states. [2025-03-08 06:47:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47707 to 47573. [2025-03-08 06:47:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47573 states, 41367 states have (on average 1.517779872845505) internal successors, (62786), 43197 states have internal predecessors, (62786), 2924 states have call successors, (2924), 1584 states have call predecessors, (2924), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-03-08 06:47:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47573 states to 47573 states and 76609 transitions. [2025-03-08 06:47:28,826 INFO L78 Accepts]: Start accepts. Automaton has 47573 states and 76609 transitions. Word has length 143 [2025-03-08 06:47:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:28,826 INFO L471 AbstractCegarLoop]: Abstraction has 47573 states and 76609 transitions. [2025-03-08 06:47:28,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47573 states and 76609 transitions. [2025-03-08 06:47:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:47:28,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:28,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:47:28,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:47:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:47:29,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 142759383, now seen corresponding path program 1 times [2025-03-08 06:47:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775561956] [2025-03-08 06:47:29,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:29,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:29,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:47:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775561956] [2025-03-08 06:47:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775561956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:47:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72187027] [2025-03-08 06:47:29,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:29,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:47:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:47:29,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:47:29,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:47:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:29,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:29,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:29,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:29,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:47:29,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:47:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 06:47:29,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:47:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72187027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:47:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:47:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328300127] [2025-03-08 06:47:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:29,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:47:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:29,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:47:29,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:29,309 INFO L87 Difference]: Start difference. First operand 47573 states and 76609 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:47:33,307 INFO L93 Difference]: Finished difference Result 137514 states and 221701 transitions. [2025-03-08 06:47:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:47:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 143 [2025-03-08 06:47:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:47:33,653 INFO L225 Difference]: With dead ends: 137514 [2025-03-08 06:47:33,653 INFO L226 Difference]: Without dead ends: 92075 [2025-03-08 06:47:33,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:33,741 INFO L435 NwaCegarLoop]: 4214 mSDtfsCounter, 4173 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:47:33,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 4444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:47:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92075 states. [2025-03-08 06:47:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92075 to 91809. [2025-03-08 06:47:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91809 states, 79539 states have (on average 1.5054501565269867) internal successors, (119742), 83197 states have internal predecessors, (119742), 5708 states have call successors, (5708), 3168 states have call predecessors, (5708), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-03-08 06:47:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91809 states to 91809 states and 147077 transitions. [2025-03-08 06:47:38,761 INFO L78 Accepts]: Start accepts. Automaton has 91809 states and 147077 transitions. Word has length 143 [2025-03-08 06:47:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:47:38,762 INFO L471 AbstractCegarLoop]: Abstraction has 91809 states and 147077 transitions. [2025-03-08 06:47:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:47:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 91809 states and 147077 transitions. [2025-03-08 06:47:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:47:38,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:47:38,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:47:38,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:47:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:47:39,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:47:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:47:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1674260719, now seen corresponding path program 1 times [2025-03-08 06:47:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:47:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866121419] [2025-03-08 06:47:39,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:47:39,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:39,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:47:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:47:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866121419] [2025-03-08 06:47:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866121419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:47:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068171070] [2025-03-08 06:47:39,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:47:39,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:47:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:47:39,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:47:39,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:47:39,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:47:39,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:47:39,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:47:39,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:47:39,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:47:39,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:47:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:47:39,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:47:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068171070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:47:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:47:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:47:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395430219] [2025-03-08 06:47:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:47:39,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:47:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:47:39,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:47:39,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:47:39,302 INFO L87 Difference]: Start difference. First operand 91809 states and 147077 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)