./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_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-?-8fc3dc6-m [2025-03-16 19:54:53,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:54:53,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:54:53,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:54:53,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:54:53,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:54:53,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:54:53,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:54:53,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:54:53,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:54:53,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:54:53,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:54:53,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:54:53,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:54:53,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:54:53,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:54:53,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:54:53,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:54:53,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:54:53,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:54:53,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:54:53,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:54:53,752 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-16 19:54:53,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:54:53,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:54:53,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:54:53,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:54:53,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:54:53,983 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-16 19:54:55,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fd06455/0ced5834e79d46d78a416a472160e37a/FLAG7979fb044 [2025-03-16 19:54:55,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:54:55,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.04.cil-1.c [2025-03-16 19:54:55,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fd06455/0ced5834e79d46d78a416a472160e37a/FLAG7979fb044 [2025-03-16 19:54:56,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fd06455/0ced5834e79d46d78a416a472160e37a [2025-03-16 19:54:56,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:54:56,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:54:56,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:54:56,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:54:56,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:54:56,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:54:56" (1/1) ... [2025-03-16 19:54:56,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136375a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:56, skipping insertion in model container [2025-03-16 19:54:56,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:54:56" (1/1) ... [2025-03-16 19:54:56,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:54:57,443 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-16 19:54:57,469 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-16 19:54:57,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:54:57,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:54:58,147 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-16 19:54:58,153 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-16 19:54:58,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:54:58,208 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:54:58,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58 WrapperNode [2025-03-16 19:54:58,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:54:58,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:54:58,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:54:58,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:54:58,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,619 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-03-16 19:54:58,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:54:58,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:54:58,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:54:58,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:54:58,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,767 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:54:58,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:58,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:59,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:59,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:54:59,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:54:59,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:54:59,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:54:59,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (1/1) ... [2025-03-16 19:54:59,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:54:59,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:54:59,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:54:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:54:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:54:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:54:59,089 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:54:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:54:59,089 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:54:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:54:59,089 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:54:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:54:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:54:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:54:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:54:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:54:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:54:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:54:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:54:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:54:59,174 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:54:59,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:55:04,867 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:55:04,867 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:55:04,868 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:55:04,868 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:55:04,868 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:55:04,868 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:55:04,868 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:55:05,038 INFO L? ?]: Removed 1700 outVars from TransFormulas that were not future-live. [2025-03-16 19:55:05,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:55:05,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:55:05,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:55:05,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:55:05 BoogieIcfgContainer [2025-03-16 19:55:05,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:55:05,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:55:05,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:55:05,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:55:05,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:54:56" (1/3) ... [2025-03-16 19:55:05,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30d6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:55:05, skipping insertion in model container [2025-03-16 19:55:05,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:54:58" (2/3) ... [2025-03-16 19:55:05,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30d6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:55:05, skipping insertion in model container [2025-03-16 19:55:05,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:55:05" (3/3) ... [2025-03-16 19:55:05,103 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.04.cil-1.c [2025-03-16 19:55:05,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:55:05,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.04.cil-1.c that has 7 procedures, 2292 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-16 19:55:05,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:55:05,208 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;@7a376a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:55:05,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:55:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 2292 states, 2266 states have (on average 1.8773168578993822) internal successors, (4254), 2268 states have internal predecessors, (4254), 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-16 19:55:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:05,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:05,226 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] [2025-03-16 19:55:05,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2054451227, now seen corresponding path program 1 times [2025-03-16 19:55:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715569203] [2025-03-16 19:55:05,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:05,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:05,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:05,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715569203] [2025-03-16 19:55:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715569203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:05,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:55:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126278453] [2025-03-16 19:55:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:55:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:05,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:55:05,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:55:05,478 INFO L87 Difference]: Start difference. First operand has 2292 states, 2266 states have (on average 1.8773168578993822) internal successors, (4254), 2268 states have internal predecessors, (4254), 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 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:05,638 INFO L93 Difference]: Finished difference Result 4580 states and 8570 transitions. [2025-03-16 19:55:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:55:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2025-03-16 19:55:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:05,664 INFO L225 Difference]: With dead ends: 4580 [2025-03-16 19:55:05,664 INFO L226 Difference]: Without dead ends: 2287 [2025-03-16 19:55:05,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:55:05,673 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 254 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:05,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 8181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:55:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-03-16 19:55:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2025-03-16 19:55:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2261 states have (on average 1.8474126492702345) internal successors, (4177), 2263 states have internal predecessors, (4177), 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-16 19:55:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4213 transitions. [2025-03-16 19:55:05,852 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4213 transitions. Word has length 81 [2025-03-16 19:55:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:05,852 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4213 transitions. [2025-03-16 19:55:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4213 transitions. [2025-03-16 19:55:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:05,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:05,857 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] [2025-03-16 19:55:05,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:55:05,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1284994790, now seen corresponding path program 1 times [2025-03-16 19:55:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601717645] [2025-03-16 19:55:05,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:05,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:05,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:05,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:05,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601717645] [2025-03-16 19:55:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601717645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323991224] [2025-03-16 19:55:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:06,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:06,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:06,083 INFO L87 Difference]: Start difference. First operand 2287 states and 4213 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:06,434 INFO L93 Difference]: Finished difference Result 2616 states and 4726 transitions. [2025-03-16 19:55:06,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:55:06,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:06,446 INFO L225 Difference]: With dead ends: 2616 [2025-03-16 19:55:06,449 INFO L226 Difference]: Without dead ends: 2460 [2025-03-16 19:55:06,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:06,452 INFO L435 NwaCegarLoop]: 4156 mSDtfsCounter, 4410 mSDsluCounter, 8404 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 12560 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:06,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 12560 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-03-16 19:55:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2447. [2025-03-16 19:55:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2401 states have (on average 1.831320283215327) internal successors, (4397), 2404 states have internal predecessors, (4397), 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-16 19:55:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4460 transitions. [2025-03-16 19:55:06,516 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4460 transitions. Word has length 81 [2025-03-16 19:55:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:06,516 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 4460 transitions. [2025-03-16 19:55:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4460 transitions. [2025-03-16 19:55:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:06,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:06,521 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] [2025-03-16 19:55:06,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:55:06,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1993894342, now seen corresponding path program 1 times [2025-03-16 19:55:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26948349] [2025-03-16 19:55:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:06,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:06,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:06,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26948349] [2025-03-16 19:55:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26948349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967764047] [2025-03-16 19:55:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:06,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:06,680 INFO L87 Difference]: Start difference. First operand 2447 states and 4460 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:06,901 INFO L93 Difference]: Finished difference Result 2793 states and 5004 transitions. [2025-03-16 19:55:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:06,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:06,919 INFO L225 Difference]: With dead ends: 2793 [2025-03-16 19:55:06,919 INFO L226 Difference]: Without dead ends: 2477 [2025-03-16 19:55:06,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:06,922 INFO L435 NwaCegarLoop]: 4127 mSDtfsCounter, 4301 mSDsluCounter, 8198 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4313 SdHoareTripleChecker+Valid, 12325 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:06,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4313 Valid, 12325 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:55:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-16 19:55:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2447. [2025-03-16 19:55:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2401 states have (on average 1.8304872969596002) internal successors, (4395), 2404 states have internal predecessors, (4395), 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-16 19:55:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4458 transitions. [2025-03-16 19:55:06,971 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4458 transitions. Word has length 81 [2025-03-16 19:55:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:06,972 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 4458 transitions. [2025-03-16 19:55:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4458 transitions. [2025-03-16 19:55:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:06,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:06,973 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] [2025-03-16 19:55:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:55:06,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:06,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1692996091, now seen corresponding path program 1 times [2025-03-16 19:55:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999330645] [2025-03-16 19:55:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:06,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:06,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:07,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999330645] [2025-03-16 19:55:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999330645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:07,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052851735] [2025-03-16 19:55:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:07,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:07,107 INFO L87 Difference]: Start difference. First operand 2447 states and 4458 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:07,607 INFO L93 Difference]: Finished difference Result 2960 states and 5253 transitions. [2025-03-16 19:55:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:07,616 INFO L225 Difference]: With dead ends: 2960 [2025-03-16 19:55:07,616 INFO L226 Difference]: Without dead ends: 2644 [2025-03-16 19:55:07,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:07,618 INFO L435 NwaCegarLoop]: 4282 mSDtfsCounter, 4396 mSDsluCounter, 12827 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 17109 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:07,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4408 Valid, 17109 Invalid, 558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:55:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2025-03-16 19:55:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2595. [2025-03-16 19:55:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2529 states have (on average 1.8149466192170818) internal successors, (4590), 2533 states have internal predecessors, (4590), 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-16 19:55:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4682 transitions. [2025-03-16 19:55:07,668 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4682 transitions. Word has length 81 [2025-03-16 19:55:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 4682 transitions. [2025-03-16 19:55:07,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4682 transitions. [2025-03-16 19:55:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:07,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:07,670 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] [2025-03-16 19:55:07,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:55:07,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -820471270, now seen corresponding path program 1 times [2025-03-16 19:55:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578455547] [2025-03-16 19:55:07,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:07,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:07,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578455547] [2025-03-16 19:55:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578455547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280782824] [2025-03-16 19:55:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:07,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:07,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:07,786 INFO L87 Difference]: Start difference. First operand 2595 states and 4682 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:08,186 INFO L93 Difference]: Finished difference Result 3423 states and 5962 transitions. [2025-03-16 19:55:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:08,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:08,201 INFO L225 Difference]: With dead ends: 3423 [2025-03-16 19:55:08,201 INFO L226 Difference]: Without dead ends: 2959 [2025-03-16 19:55:08,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:08,205 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4391 mSDsluCounter, 12815 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 17093 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:08,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 17093 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:55:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-16 19:55:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2906. [2025-03-16 19:55:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2798 states have (on average 1.7880629020729093) internal successors, (5003), 2806 states have internal predecessors, (5003), 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-16 19:55:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 5159 transitions. [2025-03-16 19:55:08,285 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 5159 transitions. Word has length 81 [2025-03-16 19:55:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:08,286 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 5159 transitions. [2025-03-16 19:55:08,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 5159 transitions. [2025-03-16 19:55:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:08,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:08,287 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] [2025-03-16 19:55:08,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:55:08,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:08,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 483922459, now seen corresponding path program 1 times [2025-03-16 19:55:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331743651] [2025-03-16 19:55:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:08,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:08,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:08,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331743651] [2025-03-16 19:55:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331743651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012353260] [2025-03-16 19:55:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:08,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:08,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:08,379 INFO L87 Difference]: Start difference. First operand 2906 states and 5159 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:08,882 INFO L93 Difference]: Finished difference Result 4404 states and 7493 transitions. [2025-03-16 19:55:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:08,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:08,910 INFO L225 Difference]: With dead ends: 4404 [2025-03-16 19:55:08,910 INFO L226 Difference]: Without dead ends: 3629 [2025-03-16 19:55:08,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:08,913 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 4386 mSDsluCounter, 12806 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 17081 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:08,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 17081 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:55:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2025-03-16 19:55:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3567. [2025-03-16 19:55:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3369 states have (on average 1.7474027901454439) internal successors, (5887), 3391 states have internal predecessors, (5887), 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-16 19:55:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 6195 transitions. [2025-03-16 19:55:09,086 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 6195 transitions. Word has length 81 [2025-03-16 19:55:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:09,087 INFO L471 AbstractCegarLoop]: Abstraction has 3567 states and 6195 transitions. [2025-03-16 19:55:09,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 6195 transitions. [2025-03-16 19:55:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:09,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:09,094 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] [2025-03-16 19:55:09,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:55:09,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1690757638, now seen corresponding path program 1 times [2025-03-16 19:55:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179343519] [2025-03-16 19:55:09,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:09,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:09,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:09,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:09,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:09,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:09,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179343519] [2025-03-16 19:55:09,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179343519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843293028] [2025-03-16 19:55:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:09,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:09,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:09,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:09,227 INFO L87 Difference]: Start difference. First operand 3567 states and 6195 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:09,718 INFO L93 Difference]: Finished difference Result 6727 states and 11224 transitions. [2025-03-16 19:55:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:09,739 INFO L225 Difference]: With dead ends: 6727 [2025-03-16 19:55:09,739 INFO L226 Difference]: Without dead ends: 5291 [2025-03-16 19:55:09,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:09,746 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4419 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 17056 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:09,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 17056 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:55:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2025-03-16 19:55:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 4964. [2025-03-16 19:55:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4576 states have (on average 1.6999562937062938) internal successors, (7779), 4644 states have internal predecessors, (7779), 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-16 19:55:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8471 transitions. [2025-03-16 19:55:09,937 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8471 transitions. Word has length 81 [2025-03-16 19:55:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:09,937 INFO L471 AbstractCegarLoop]: Abstraction has 4964 states and 8471 transitions. [2025-03-16 19:55:09,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8471 transitions. [2025-03-16 19:55:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:09,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:09,939 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] [2025-03-16 19:55:09,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:55:09,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1899455941, now seen corresponding path program 1 times [2025-03-16 19:55:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325148895] [2025-03-16 19:55:09,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:09,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:09,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:09,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325148895] [2025-03-16 19:55:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325148895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:10,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:10,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531711271] [2025-03-16 19:55:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:10,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:10,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:10,015 INFO L87 Difference]: Start difference. First operand 4964 states and 8471 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:10,288 INFO L93 Difference]: Finished difference Result 8212 states and 13841 transitions. [2025-03-16 19:55:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:10,319 INFO L225 Difference]: With dead ends: 8212 [2025-03-16 19:55:10,320 INFO L226 Difference]: Without dead ends: 5379 [2025-03-16 19:55:10,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:10,332 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 4275 mSDsluCounter, 8194 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4287 SdHoareTripleChecker+Valid, 12329 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:10,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4287 Valid, 12329 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:55:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2025-03-16 19:55:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4964. [2025-03-16 19:55:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4576 states have (on average 1.6962412587412588) internal successors, (7762), 4644 states have internal predecessors, (7762), 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-16 19:55:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8454 transitions. [2025-03-16 19:55:10,554 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8454 transitions. Word has length 81 [2025-03-16 19:55:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 4964 states and 8454 transitions. [2025-03-16 19:55:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8454 transitions. [2025-03-16 19:55:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:10,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:10,558 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] [2025-03-16 19:55:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:55:10,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 587663834, now seen corresponding path program 1 times [2025-03-16 19:55:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204497334] [2025-03-16 19:55:10,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:10,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:10,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:10,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204497334] [2025-03-16 19:55:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204497334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:10,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753252912] [2025-03-16 19:55:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:10,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:10,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:10,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:10,647 INFO L87 Difference]: Start difference. First operand 4964 states and 8454 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:11,391 INFO L93 Difference]: Finished difference Result 11122 states and 18615 transitions. [2025-03-16 19:55:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:11,425 INFO L225 Difference]: With dead ends: 11122 [2025-03-16 19:55:11,426 INFO L226 Difference]: Without dead ends: 8289 [2025-03-16 19:55:11,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:11,436 INFO L435 NwaCegarLoop]: 4262 mSDtfsCounter, 4433 mSDsluCounter, 12763 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 17025 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:11,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 17025 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2025-03-16 19:55:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 7896. [2025-03-16 19:55:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6475571872352444) internal successors, (11668), 7296 states have internal predecessors, (11668), 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-16 19:55:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13496 transitions. [2025-03-16 19:55:11,785 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13496 transitions. Word has length 81 [2025-03-16 19:55:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:11,786 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13496 transitions. [2025-03-16 19:55:11,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13496 transitions. [2025-03-16 19:55:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:11,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:11,791 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] [2025-03-16 19:55:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:55:11,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash -579032485, now seen corresponding path program 1 times [2025-03-16 19:55:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686771093] [2025-03-16 19:55:11,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:11,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:11,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:11,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:11,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686771093] [2025-03-16 19:55:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686771093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252186537] [2025-03-16 19:55:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:11,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:11,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:11,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:11,865 INFO L87 Difference]: Start difference. First operand 7896 states and 13496 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:12,275 INFO L93 Difference]: Finished difference Result 14396 states and 24845 transitions. [2025-03-16 19:55:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:12,306 INFO L225 Difference]: With dead ends: 14396 [2025-03-16 19:55:12,306 INFO L226 Difference]: Without dead ends: 8631 [2025-03-16 19:55:12,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:12,323 INFO L435 NwaCegarLoop]: 4130 mSDtfsCounter, 4271 mSDsluCounter, 8185 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 12315 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:12,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 12315 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:55:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2025-03-16 19:55:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 7896. [2025-03-16 19:55:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6428974865857102) internal successors, (11635), 7296 states have internal predecessors, (11635), 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-16 19:55:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13463 transitions. [2025-03-16 19:55:12,732 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13463 transitions. Word has length 81 [2025-03-16 19:55:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:12,732 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13463 transitions. [2025-03-16 19:55:12,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13463 transitions. [2025-03-16 19:55:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:12,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:12,739 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] [2025-03-16 19:55:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:55:12,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -478120518, now seen corresponding path program 1 times [2025-03-16 19:55:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992200567] [2025-03-16 19:55:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:12,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:12,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:12,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992200567] [2025-03-16 19:55:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992200567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:12,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:12,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:12,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202012718] [2025-03-16 19:55:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:12,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:12,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:12,829 INFO L87 Difference]: Start difference. First operand 7896 states and 13463 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:13,367 INFO L93 Difference]: Finished difference Result 14151 states and 24289 transitions. [2025-03-16 19:55:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:13,395 INFO L225 Difference]: With dead ends: 14151 [2025-03-16 19:55:13,395 INFO L226 Difference]: Without dead ends: 8386 [2025-03-16 19:55:13,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:13,411 INFO L435 NwaCegarLoop]: 4124 mSDtfsCounter, 4269 mSDsluCounter, 8177 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4281 SdHoareTripleChecker+Valid, 12301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:13,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4281 Valid, 12301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-16 19:55:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 7896. [2025-03-16 19:55:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7082 states have (on average 1.6382377859361763) internal successors, (11602), 7296 states have internal predecessors, (11602), 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-16 19:55:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 13430 transitions. [2025-03-16 19:55:13,752 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 13430 transitions. Word has length 81 [2025-03-16 19:55:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 7896 states and 13430 transitions. [2025-03-16 19:55:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 13430 transitions. [2025-03-16 19:55:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:13,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:13,757 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] [2025-03-16 19:55:13,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:55:13,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:13,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash -197770629, now seen corresponding path program 1 times [2025-03-16 19:55:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:13,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366606994] [2025-03-16 19:55:13,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:13,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:13,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366606994] [2025-03-16 19:55:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366606994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:55:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499889180] [2025-03-16 19:55:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:13,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:55:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:13,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:55:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:13,808 INFO L87 Difference]: Start difference. First operand 7896 states and 13430 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:14,283 INFO L93 Difference]: Finished difference Result 13726 states and 23184 transitions. [2025-03-16 19:55:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:14,329 INFO L225 Difference]: With dead ends: 13726 [2025-03-16 19:55:14,329 INFO L226 Difference]: Without dead ends: 7962 [2025-03-16 19:55:14,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:14,348 INFO L435 NwaCegarLoop]: 4207 mSDtfsCounter, 0 mSDsluCounter, 8409 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12616 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:14,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12616 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:55:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2025-03-16 19:55:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7962. [2025-03-16 19:55:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7962 states, 7148 states have (on average 1.6323447118074985) internal successors, (11668), 7362 states have internal predecessors, (11668), 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-16 19:55:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7962 states to 7962 states and 13496 transitions. [2025-03-16 19:55:14,692 INFO L78 Accepts]: Start accepts. Automaton has 7962 states and 13496 transitions. Word has length 81 [2025-03-16 19:55:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:14,692 INFO L471 AbstractCegarLoop]: Abstraction has 7962 states and 13496 transitions. [2025-03-16 19:55:14,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7962 states and 13496 transitions. [2025-03-16 19:55:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:14,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:14,697 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] [2025-03-16 19:55:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:55:14,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 935419964, now seen corresponding path program 1 times [2025-03-16 19:55:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031492137] [2025-03-16 19:55:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:14,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:14,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:14,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031492137] [2025-03-16 19:55:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031492137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:55:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454397665] [2025-03-16 19:55:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:14,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:55:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:14,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:55:14,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:14,741 INFO L87 Difference]: Start difference. First operand 7962 states and 13496 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:15,214 INFO L93 Difference]: Finished difference Result 19504 states and 32520 transitions. [2025-03-16 19:55:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:15,258 INFO L225 Difference]: With dead ends: 19504 [2025-03-16 19:55:15,258 INFO L226 Difference]: Without dead ends: 13674 [2025-03-16 19:55:15,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:15,277 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4397 mSDsluCounter, 4356 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 8777 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:15,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 8777 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:55:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13674 states. [2025-03-16 19:55:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13674 to 13639. [2025-03-16 19:55:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13639 states, 12034 states have (on average 1.5871696858899784) internal successors, (19100), 12460 states have internal predecessors, (19100), 783 states have call successors, (783), 396 states have call predecessors, (783), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:55:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13639 states to 13639 states and 22683 transitions. [2025-03-16 19:55:16,015 INFO L78 Accepts]: Start accepts. Automaton has 13639 states and 22683 transitions. Word has length 81 [2025-03-16 19:55:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:16,016 INFO L471 AbstractCegarLoop]: Abstraction has 13639 states and 22683 transitions. [2025-03-16 19:55:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13639 states and 22683 transitions. [2025-03-16 19:55:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:16,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:16,020 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] [2025-03-16 19:55:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:55:16,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:16,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1011501441, now seen corresponding path program 1 times [2025-03-16 19:55:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686040226] [2025-03-16 19:55:16,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:16,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:16,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686040226] [2025-03-16 19:55:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686040226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:55:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974331761] [2025-03-16 19:55:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:55:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:55:16,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:16,068 INFO L87 Difference]: Start difference. First operand 13639 states and 22683 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:16,597 INFO L93 Difference]: Finished difference Result 25212 states and 41873 transitions. [2025-03-16 19:55:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:16,634 INFO L225 Difference]: With dead ends: 25212 [2025-03-16 19:55:16,634 INFO L226 Difference]: Without dead ends: 13705 [2025-03-16 19:55:16,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:55:16,651 INFO L435 NwaCegarLoop]: 4207 mSDtfsCounter, 0 mSDsluCounter, 8409 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12616 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:16,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12616 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:55:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13705 states. [2025-03-16 19:55:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13705 to 13705. [2025-03-16 19:55:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13705 states, 12100 states have (on average 1.5812396694214876) internal successors, (19133), 12526 states have internal predecessors, (19133), 783 states have call successors, (783), 396 states have call predecessors, (783), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:55:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13705 states to 13705 states and 22716 transitions. [2025-03-16 19:55:17,378 INFO L78 Accepts]: Start accepts. Automaton has 13705 states and 22716 transitions. Word has length 81 [2025-03-16 19:55:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:17,379 INFO L471 AbstractCegarLoop]: Abstraction has 13705 states and 22716 transitions. [2025-03-16 19:55:17,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13705 states and 22716 transitions. [2025-03-16 19:55:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:55:17,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:17,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:55:17,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:55:17,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:17,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2100118558, now seen corresponding path program 1 times [2025-03-16 19:55:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904886577] [2025-03-16 19:55:17,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:17,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:55:17,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:55:17,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:17,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904886577] [2025-03-16 19:55:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904886577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849923931] [2025-03-16 19:55:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:17,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:17,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:17,452 INFO L87 Difference]: Start difference. First operand 13705 states and 22716 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:19,781 INFO L93 Difference]: Finished difference Result 69646 states and 115795 transitions. [2025-03-16 19:55:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:55:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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 81 [2025-03-16 19:55:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:20,069 INFO L225 Difference]: With dead ends: 69646 [2025-03-16 19:55:20,070 INFO L226 Difference]: Without dead ends: 58073 [2025-03-16 19:55:20,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:55:20,120 INFO L435 NwaCegarLoop]: 4403 mSDtfsCounter, 9066 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9068 SdHoareTripleChecker+Valid, 8945 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:20,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9068 Valid, 8945 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58073 states. [2025-03-16 19:55:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58073 to 57477. [2025-03-16 19:55:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57477 states, 49674 states have (on average 1.5303579337279059) internal successors, (76019), 51994 states have internal predecessors, (76019), 3701 states have call successors, (3701), 1980 states have call predecessors, (3701), 4100 states have return successors, (15062), 3534 states have call predecessors, (15062), 3701 states have call successors, (15062) [2025-03-16 19:55:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57477 states to 57477 states and 94782 transitions. [2025-03-16 19:55:23,424 INFO L78 Accepts]: Start accepts. Automaton has 57477 states and 94782 transitions. Word has length 81 [2025-03-16 19:55:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:23,424 INFO L471 AbstractCegarLoop]: Abstraction has 57477 states and 94782 transitions. [2025-03-16 19:55:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (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-16 19:55:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 57477 states and 94782 transitions. [2025-03-16 19:55:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:55:23,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:23,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:55:23,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:55:23,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:23,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 780687508, now seen corresponding path program 1 times [2025-03-16 19:55:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576840151] [2025-03-16 19:55:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:23,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:55:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:55:23,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:23,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 19:55:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576840151] [2025-03-16 19:55:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576840151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:55:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294987078] [2025-03-16 19:55:23,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:23,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:55:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:55:23,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:55:23,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:55:23,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:55:23,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:55:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:23,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:55:23,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:55:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:55:23,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:55:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294987078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:23,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:55:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:55:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136293984] [2025-03-16 19:55:23,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:23,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:55:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:23,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:55:23,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:23,722 INFO L87 Difference]: Start difference. First operand 57477 states and 94782 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (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-16 19:55:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:28,571 INFO L93 Difference]: Finished difference Result 166516 states and 276311 transitions. [2025-03-16 19:55:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:55:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (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 131 [2025-03-16 19:55:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:29,079 INFO L225 Difference]: With dead ends: 166516 [2025-03-16 19:55:29,079 INFO L226 Difference]: Without dead ends: 111171 [2025-03-16 19:55:29,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:29,207 INFO L435 NwaCegarLoop]: 4206 mSDtfsCounter, 4157 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:29,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4430 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:55:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111171 states. [2025-03-16 19:55:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111171 to 110839. [2025-03-16 19:55:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110839 states, 95569 states have (on average 1.5216963659764149) internal successors, (145427), 100207 states have internal predecessors, (145427), 7068 states have call successors, (7068), 3960 states have call predecessors, (7068), 8200 states have return successors, (29495), 6703 states have call predecessors, (29495), 7068 states have call successors, (29495) [2025-03-16 19:55:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110839 states to 110839 states and 181990 transitions. [2025-03-16 19:55:36,092 INFO L78 Accepts]: Start accepts. Automaton has 110839 states and 181990 transitions. Word has length 131 [2025-03-16 19:55:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:36,092 INFO L471 AbstractCegarLoop]: Abstraction has 110839 states and 181990 transitions. [2025-03-16 19:55:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (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-16 19:55:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 110839 states and 181990 transitions. [2025-03-16 19:55:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:55:36,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:36,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:55:36,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:55:36,366 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,SelfDestructingSolverStorable15 [2025-03-16 19:55:36,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1807074316, now seen corresponding path program 1 times [2025-03-16 19:55:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054452626] [2025-03-16 19:55:36,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:36,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:55:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:55:36,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:36,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 19:55:36,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:36,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054452626] [2025-03-16 19:55:36,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054452626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:55:36,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197520149] [2025-03-16 19:55:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:36,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:55:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:55:36,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:55:36,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:55:36,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:55:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:55:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:36,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:55:36,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:55:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:55:36,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:55:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197520149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:55:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:55:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501818913] [2025-03-16 19:55:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:36,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:55:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:36,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:55:36,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:36,586 INFO L87 Difference]: Start difference. First operand 110839 states and 181990 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (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)