./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/pc_sfifo_3.cil+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:23:24,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:23:24,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:23:24,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:23:24,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:23:24,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:23:24,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:23:24,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:23:24,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:23:24,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:23:24,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:23:24,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:23:24,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:23:24,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:24,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:23:24,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:23:24,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:23:24,546 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 -> 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 [2025-03-03 16:23:24,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:23:24,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:23:24,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:23:24,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:23:24,775 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:23:24,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2025-03-03 16:23:25,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec0026ac/bb3411a8d8bf4d61b6964a83c3ef4c89/FLAGf2055adbd [2025-03-03 16:23:26,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:23:26,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2025-03-03 16:23:26,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec0026ac/bb3411a8d8bf4d61b6964a83c3ef4c89/FLAGf2055adbd [2025-03-03 16:23:26,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec0026ac/bb3411a8d8bf4d61b6964a83c3ef4c89 [2025-03-03 16:23:26,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:23:26,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:23:26,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:26,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:23:26,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:23:26,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d0c8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26, skipping insertion in model container [2025-03-03 16:23:26,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:23:26,656 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2025-03-03 16:23:26,714 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2025-03-03 16:23:26,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:26,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:23:26,780 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2025-03-03 16:23:26,802 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2025-03-03 16:23:26,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:26,833 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:23:26,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26 WrapperNode [2025-03-03 16:23:26,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:26,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:26,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:23:26,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:23:26,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,873 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 536 [2025-03-03 16:23:26,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:26,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:23:26,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:23:26,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:23:26,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,895 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-03 16:23:26,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:23:26,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:23:26,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:23:26,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:23:26,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (1/1) ... [2025-03-03 16:23:26,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:26,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:26,932 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-03 16:23:26,934 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-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:23:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:23:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:23:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:23:26,951 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:23:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:23:26,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:23:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:23:26,952 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:23:27,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:23:27,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:23:27,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:23:27,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:23:27,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:23:27,545 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-03-03 16:23:27,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:23:27,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:23:27,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:23:27,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:27 BoogieIcfgContainer [2025-03-03 16:23:27,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:23:27,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:23:27,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:23:27,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:23:27,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:23:26" (1/3) ... [2025-03-03 16:23:27,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb7c5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:27, skipping insertion in model container [2025-03-03 16:23:27,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:26" (2/3) ... [2025-03-03 16:23:27,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb7c5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:27, skipping insertion in model container [2025-03-03 16:23:27,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:27" (3/3) ... [2025-03-03 16:23:27,574 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c [2025-03-03 16:23:27,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:23:27,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c that has 15 procedures, 284 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-03 16:23:27,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:23:27,664 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;@6a10ddf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:23:27,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:23:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 234 states have (on average 1.5042735042735043) internal successors, (352), 240 states have internal predecessors, (352), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 16:23:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:27,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:27,681 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] [2025-03-03 16:23:27,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1172470590, now seen corresponding path program 1 times [2025-03-03 16:23:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700318708] [2025-03-03 16:23:27,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:27,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:27,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:27,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:27,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700318708] [2025-03-03 16:23:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700318708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145095310] [2025-03-03 16:23:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:28,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:28,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:28,155 INFO L87 Difference]: Start difference. First operand has 284 states, 234 states have (on average 1.5042735042735043) internal successors, (352), 240 states have internal predecessors, (352), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:28,736 INFO L93 Difference]: Finished difference Result 670 states and 991 transitions. [2025-03-03 16:23:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:28,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:23:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:28,755 INFO L225 Difference]: With dead ends: 670 [2025-03-03 16:23:28,755 INFO L226 Difference]: Without dead ends: 395 [2025-03-03 16:23:28,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-03 16:23:28,761 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 342 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:28,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 925 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-03 16:23:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 388. [2025-03-03 16:23:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 318 states have (on average 1.4433962264150944) internal successors, (459), 324 states have internal predecessors, (459), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-03-03 16:23:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 554 transitions. [2025-03-03 16:23:28,820 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 554 transitions. Word has length 65 [2025-03-03 16:23:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 554 transitions. [2025-03-03 16:23:28,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 554 transitions. [2025-03-03 16:23:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:28,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:28,823 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] [2025-03-03 16:23:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:23:28,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457378, now seen corresponding path program 1 times [2025-03-03 16:23:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687934493] [2025-03-03 16:23:28,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:29,022 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-03 16:23:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687934493] [2025-03-03 16:23:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687934493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761424372] [2025-03-03 16:23:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:29,025 INFO L87 Difference]: Start difference. First operand 388 states and 554 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:29,580 INFO L93 Difference]: Finished difference Result 761 states and 1075 transitions. [2025-03-03 16:23:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:23:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:29,587 INFO L225 Difference]: With dead ends: 761 [2025-03-03 16:23:29,587 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 16:23:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-03 16:23:29,589 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 562 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:29,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1220 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 16:23:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 502. [2025-03-03 16:23:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 410 states have (on average 1.4317073170731707) internal successors, (587), 418 states have internal predecessors, (587), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-03-03 16:23:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 716 transitions. [2025-03-03 16:23:29,630 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 716 transitions. Word has length 65 [2025-03-03 16:23:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 716 transitions. [2025-03-03 16:23:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 716 transitions. [2025-03-03 16:23:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:29,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:29,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:23:29,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1347319325, now seen corresponding path program 1 times [2025-03-03 16:23:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843642172] [2025-03-03 16:23:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:29,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:29,764 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-03 16:23:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843642172] [2025-03-03 16:23:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843642172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225089638] [2025-03-03 16:23:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:29,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:29,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:29,767 INFO L87 Difference]: Start difference. First operand 502 states and 716 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:23:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:30,696 INFO L93 Difference]: Finished difference Result 1964 states and 2780 transitions. [2025-03-03 16:23:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-03-03 16:23:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:30,703 INFO L225 Difference]: With dead ends: 1964 [2025-03-03 16:23:30,703 INFO L226 Difference]: Without dead ends: 1625 [2025-03-03 16:23:30,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:30,705 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1994 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:30,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 1447 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-03-03 16:23:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1572. [2025-03-03 16:23:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1275 states have (on average 1.3709803921568628) internal successors, (1748), 1298 states have internal predecessors, (1748), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2025-03-03 16:23:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2120 transitions. [2025-03-03 16:23:30,793 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2120 transitions. Word has length 65 [2025-03-03 16:23:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2120 transitions. [2025-03-03 16:23:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:23:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2120 transitions. [2025-03-03 16:23:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:30,795 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] [2025-03-03 16:23:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:23:30,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1925335917, now seen corresponding path program 1 times [2025-03-03 16:23:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035030853] [2025-03-03 16:23:30,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:30,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:30,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:30,868 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-03 16:23:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035030853] [2025-03-03 16:23:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035030853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:30,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:30,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773951269] [2025-03-03 16:23:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:30,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:30,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:30,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:30,870 INFO L87 Difference]: Start difference. First operand 1572 states and 2120 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:30,956 INFO L93 Difference]: Finished difference Result 3015 states and 4068 transitions. [2025-03-03 16:23:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:23:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:30,965 INFO L225 Difference]: With dead ends: 3015 [2025-03-03 16:23:30,965 INFO L226 Difference]: Without dead ends: 1612 [2025-03-03 16:23:30,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:30,970 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:30,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1949 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-03 16:23:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2025-03-03 16:23:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1307 states have (on average 1.3573068094873757) internal successors, (1774), 1330 states have internal predecessors, (1774), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2025-03-03 16:23:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2154 transitions. [2025-03-03 16:23:31,077 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2154 transitions. Word has length 66 [2025-03-03 16:23:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:31,077 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2154 transitions. [2025-03-03 16:23:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2154 transitions. [2025-03-03 16:23:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:31,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:31,079 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] [2025-03-03 16:23:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:23:31,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:31,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash -292531918, now seen corresponding path program 1 times [2025-03-03 16:23:31,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:31,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533825475] [2025-03-03 16:23:31,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:31,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:31,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:31,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:31,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:31,185 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-03 16:23:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533825475] [2025-03-03 16:23:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533825475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537472776] [2025-03-03 16:23:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:31,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:31,187 INFO L87 Difference]: Start difference. First operand 1612 states and 2154 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:32,186 INFO L93 Difference]: Finished difference Result 5048 states and 6788 transitions. [2025-03-03 16:23:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2025-03-03 16:23:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:32,196 INFO L225 Difference]: With dead ends: 5048 [2025-03-03 16:23:32,196 INFO L226 Difference]: Without dead ends: 1878 [2025-03-03 16:23:32,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:32,203 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2075 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:32,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 1476 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2025-03-03 16:23:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1808. [2025-03-03 16:23:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1431 states have (on average 1.3172606568832983) internal successors, (1885), 1456 states have internal predecessors, (1885), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2025-03-03 16:23:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2351 transitions. [2025-03-03 16:23:32,296 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2351 transitions. Word has length 66 [2025-03-03 16:23:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:32,296 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2351 transitions. [2025-03-03 16:23:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2351 transitions. [2025-03-03 16:23:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:32,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:32,299 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] [2025-03-03 16:23:32,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:23:32,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1125362631, now seen corresponding path program 1 times [2025-03-03 16:23:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87207523] [2025-03-03 16:23:32,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:32,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:32,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:32,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:32,385 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-03 16:23:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87207523] [2025-03-03 16:23:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87207523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591613282] [2025-03-03 16:23:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:32,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:32,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:32,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:32,388 INFO L87 Difference]: Start difference. First operand 1808 states and 2351 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03 16:23:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:32,770 INFO L93 Difference]: Finished difference Result 2118 states and 2811 transitions. [2025-03-03 16:23:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:32,779 INFO L225 Difference]: With dead ends: 2118 [2025-03-03 16:23:32,779 INFO L226 Difference]: Without dead ends: 1969 [2025-03-03 16:23:32,780 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-03 16:23:32,780 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 584 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:32,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 836 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:23:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-03 16:23:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1958. [2025-03-03 16:23:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1562 states have (on average 1.3316261203585147) internal successors, (2080), 1588 states have internal predecessors, (2080), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (270), 227 states have call predecessors, (270), 219 states have call successors, (270) [2025-03-03 16:23:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2571 transitions. [2025-03-03 16:23:32,906 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2571 transitions. Word has length 79 [2025-03-03 16:23:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2571 transitions. [2025-03-03 16:23:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03 16:23:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2571 transitions. [2025-03-03 16:23:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:32,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:32,908 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] [2025-03-03 16:23:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:23:32,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash -903596919, now seen corresponding path program 1 times [2025-03-03 16:23:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848265506] [2025-03-03 16:23:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:32,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:32,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:32,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:32,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:32,995 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-03 16:23:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848265506] [2025-03-03 16:23:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848265506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988254220] [2025-03-03 16:23:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:32,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:32,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:32,996 INFO L87 Difference]: Start difference. First operand 1958 states and 2571 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:33,522 INFO L93 Difference]: Finished difference Result 2441 states and 3288 transitions. [2025-03-03 16:23:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:33,531 INFO L225 Difference]: With dead ends: 2441 [2025-03-03 16:23:33,531 INFO L226 Difference]: Without dead ends: 2142 [2025-03-03 16:23:33,532 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-03 16:23:33,534 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 576 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:33,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1453 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-03-03 16:23:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2099. [2025-03-03 16:23:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 1684 states have (on average 1.3402612826603326) internal successors, (2257), 1711 states have internal predecessors, (2257), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (285), 240 states have call predecessors, (285), 231 states have call successors, (285) [2025-03-03 16:23:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2775 transitions. [2025-03-03 16:23:33,666 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2775 transitions. Word has length 79 [2025-03-03 16:23:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:33,667 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2775 transitions. [2025-03-03 16:23:33,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2775 transitions. [2025-03-03 16:23:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:33,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:33,668 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] [2025-03-03 16:23:33,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:23:33,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:33,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1216690280, now seen corresponding path program 1 times [2025-03-03 16:23:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657388014] [2025-03-03 16:23:33,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:33,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:33,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:33,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:33,751 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-03 16:23:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657388014] [2025-03-03 16:23:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657388014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:33,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662681154] [2025-03-03 16:23:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:33,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:33,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:33,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:33,754 INFO L87 Difference]: Start difference. First operand 2099 states and 2775 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:34,293 INFO L93 Difference]: Finished difference Result 2880 states and 3931 transitions. [2025-03-03 16:23:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:34,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:34,303 INFO L225 Difference]: With dead ends: 2880 [2025-03-03 16:23:34,304 INFO L226 Difference]: Without dead ends: 2440 [2025-03-03 16:23:34,306 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-03 16:23:34,306 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 571 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:34,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1437 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-03-03 16:23:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2394. [2025-03-03 16:23:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 1939 states have (on average 1.3563692625064465) internal successors, (2630), 1970 states have internal predecessors, (2630), 257 states have call successors, (257), 163 states have call predecessors, (257), 196 states have return successors, (321), 266 states have call predecessors, (321), 255 states have call successors, (321) [2025-03-03 16:23:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3208 transitions. [2025-03-03 16:23:34,485 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3208 transitions. Word has length 79 [2025-03-03 16:23:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:34,486 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 3208 transitions. [2025-03-03 16:23:34,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3208 transitions. [2025-03-03 16:23:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:34,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:34,488 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] [2025-03-03 16:23:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:23:34,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:34,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1007991977, now seen corresponding path program 1 times [2025-03-03 16:23:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552374223] [2025-03-03 16:23:34,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:34,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:34,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:34,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:34,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552374223] [2025-03-03 16:23:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552374223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940155686] [2025-03-03 16:23:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:34,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:34,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:34,564 INFO L87 Difference]: Start difference. First operand 2394 states and 3208 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:35,148 INFO L93 Difference]: Finished difference Result 3805 states and 5314 transitions. [2025-03-03 16:23:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:35,163 INFO L225 Difference]: With dead ends: 3805 [2025-03-03 16:23:35,164 INFO L226 Difference]: Without dead ends: 3070 [2025-03-03 16:23:35,167 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-03 16:23:35,169 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 566 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:35,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1425 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2025-03-03 16:23:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 3017. [2025-03-03 16:23:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 2476 states have (on average 1.3820678513731826) internal successors, (3422), 2521 states have internal predecessors, (3422), 305 states have call successors, (305), 187 states have call predecessors, (305), 234 states have return successors, (417), 318 states have call predecessors, (417), 303 states have call successors, (417) [2025-03-03 16:23:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4144 transitions. [2025-03-03 16:23:35,406 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4144 transitions. Word has length 79 [2025-03-03 16:23:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:35,407 INFO L471 AbstractCegarLoop]: Abstraction has 3017 states and 4144 transitions. [2025-03-03 16:23:35,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4144 transitions. [2025-03-03 16:23:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:35,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:35,411 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] [2025-03-03 16:23:35,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:23:35,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash -799855544, now seen corresponding path program 1 times [2025-03-03 16:23:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626518399] [2025-03-03 16:23:35,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:35,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:35,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:35,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:35,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:35,547 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-03 16:23:35,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626518399] [2025-03-03 16:23:35,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626518399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:35,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:35,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988522890] [2025-03-03 16:23:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:35,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:35,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:35,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:35,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:35,548 INFO L87 Difference]: Start difference. First operand 3017 states and 4144 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:36,303 INFO L93 Difference]: Finished difference Result 5976 states and 8653 transitions. [2025-03-03 16:23:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:36,324 INFO L225 Difference]: With dead ends: 5976 [2025-03-03 16:23:36,324 INFO L226 Difference]: Without dead ends: 4618 [2025-03-03 16:23:36,330 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-03 16:23:36,331 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 665 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:36,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1400 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2025-03-03 16:23:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4320. [2025-03-03 16:23:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 3597 states have (on average 1.4161801501251043) internal successors, (5094), 3688 states have internal predecessors, (5094), 393 states have call successors, (393), 235 states have call predecessors, (393), 328 states have return successors, (697), 414 states have call predecessors, (697), 391 states have call successors, (697) [2025-03-03 16:23:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 6184 transitions. [2025-03-03 16:23:36,641 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 6184 transitions. Word has length 79 [2025-03-03 16:23:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 4320 states and 6184 transitions. [2025-03-03 16:23:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 6184 transitions. [2025-03-03 16:23:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:36,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:36,645 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] [2025-03-03 16:23:36,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:23:36,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:36,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1966551863, now seen corresponding path program 1 times [2025-03-03 16:23:36,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549750738] [2025-03-03 16:23:36,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:36,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:36,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:36,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:36,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:36,725 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-03 16:23:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549750738] [2025-03-03 16:23:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549750738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345647863] [2025-03-03 16:23:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:36,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:36,727 INFO L87 Difference]: Start difference. First operand 4320 states and 6184 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:37,507 INFO L93 Difference]: Finished difference Result 10175 states and 15527 transitions. [2025-03-03 16:23:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:37,547 INFO L225 Difference]: With dead ends: 10175 [2025-03-03 16:23:37,548 INFO L226 Difference]: Without dead ends: 7514 [2025-03-03 16:23:37,560 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-03 16:23:37,561 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 629 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:37,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1384 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2025-03-03 16:23:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 6995. [2025-03-03 16:23:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5862 states have (on average 1.4476287956328897) internal successors, (8486), 6099 states have internal predecessors, (8486), 561 states have call successors, (561), 331 states have call predecessors, (561), 570 states have return successors, (1633), 598 states have call predecessors, (1633), 559 states have call successors, (1633) [2025-03-03 16:23:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 10680 transitions. [2025-03-03 16:23:38,021 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 10680 transitions. Word has length 79 [2025-03-03 16:23:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:38,021 INFO L471 AbstractCegarLoop]: Abstraction has 6995 states and 10680 transitions. [2025-03-03 16:23:38,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 10680 transitions. [2025-03-03 16:23:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:38,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:38,028 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] [2025-03-03 16:23:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:23:38,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1865639896, now seen corresponding path program 1 times [2025-03-03 16:23:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847785334] [2025-03-03 16:23:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:38,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:38,118 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-03 16:23:38,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:38,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847785334] [2025-03-03 16:23:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847785334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537801875] [2025-03-03 16:23:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:38,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:38,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:38,120 INFO L87 Difference]: Start difference. First operand 6995 states and 10680 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:39,093 INFO L93 Difference]: Finished difference Result 18730 states and 31037 transitions. [2025-03-03 16:23:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:39,148 INFO L225 Difference]: With dead ends: 18730 [2025-03-03 16:23:39,148 INFO L226 Difference]: Without dead ends: 13394 [2025-03-03 16:23:39,163 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-03 16:23:39,164 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 595 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:39,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1376 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13394 states. [2025-03-03 16:23:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13394 to 12798. [2025-03-03 16:23:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12798 states, 10699 states have (on average 1.4664921955322927) internal successors, (15690), 11390 states have internal predecessors, (15690), 881 states have call successors, (881), 523 states have call predecessors, (881), 1216 states have return successors, (5025), 950 states have call predecessors, (5025), 879 states have call successors, (5025) [2025-03-03 16:23:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12798 states to 12798 states and 21596 transitions. [2025-03-03 16:23:39,945 INFO L78 Accepts]: Start accepts. Automaton has 12798 states and 21596 transitions. Word has length 79 [2025-03-03 16:23:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:39,945 INFO L471 AbstractCegarLoop]: Abstraction has 12798 states and 21596 transitions. [2025-03-03 16:23:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12798 states and 21596 transitions. [2025-03-03 16:23:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:39,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:39,955 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] [2025-03-03 16:23:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:23:39,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1585290007, now seen corresponding path program 1 times [2025-03-03 16:23:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364104470] [2025-03-03 16:23:39,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:39,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:39,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:39,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:40,044 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-03 16:23:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364104470] [2025-03-03 16:23:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364104470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576249861] [2025-03-03 16:23:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:40,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:40,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:40,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:40,047 INFO L87 Difference]: Start difference. First operand 12798 states and 21596 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:41,881 INFO L93 Difference]: Finished difference Result 36793 states and 69787 transitions. [2025-03-03 16:23:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:41,982 INFO L225 Difference]: With dead ends: 36793 [2025-03-03 16:23:41,983 INFO L226 Difference]: Without dead ends: 25654 [2025-03-03 16:23:42,012 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-03 16:23:42,013 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 560 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:42,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1364 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25654 states. [2025-03-03 16:23:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25654 to 25013. [2025-03-03 16:23:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25013 states, 20544 states have (on average 1.4599883177570094) internal successors, (29994), 22629 states have internal predecessors, (29994), 1481 states have call successors, (1481), 899 states have call predecessors, (1481), 2986 states have return successors, (17913), 1614 states have call predecessors, (17913), 1479 states have call successors, (17913) [2025-03-03 16:23:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25013 states to 25013 states and 49388 transitions. [2025-03-03 16:23:43,936 INFO L78 Accepts]: Start accepts. Automaton has 25013 states and 49388 transitions. Word has length 79 [2025-03-03 16:23:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 25013 states and 49388 transitions. [2025-03-03 16:23:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 16:23:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 25013 states and 49388 transitions. [2025-03-03 16:23:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:23:43,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:43,953 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] [2025-03-03 16:23:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:23:43,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 779058184, now seen corresponding path program 1 times [2025-03-03 16:23:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469129661] [2025-03-03 16:23:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:23:43,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:23:43,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:44,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-03 16:23:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469129661] [2025-03-03 16:23:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469129661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:44,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:44,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:23:44,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163217985] [2025-03-03 16:23:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:44,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:23:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:44,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:23:44,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:44,016 INFO L87 Difference]: Start difference. First operand 25013 states and 49388 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03 16:23:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:46,457 INFO L93 Difference]: Finished difference Result 61167 states and 122116 transitions. [2025-03-03 16:23:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:23:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 16:23:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:46,644 INFO L225 Difference]: With dead ends: 61167 [2025-03-03 16:23:46,645 INFO L226 Difference]: Without dead ends: 37814 [2025-03-03 16:23:46,709 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-03 16:23:46,709 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 545 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:46,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1063 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:23:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37814 states. [2025-03-03 16:23:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37814 to 35481. [2025-03-03 16:23:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35481 states, 29271 states have (on average 1.4472003006388576) internal successors, (42361), 32087 states have internal predecessors, (42361), 2166 states have call successors, (2166), 1289 states have call predecessors, (2166), 4042 states have return successors, (22631), 2234 states have call predecessors, (22631), 2164 states have call successors, (22631) [2025-03-03 16:23:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35481 states to 35481 states and 67158 transitions. [2025-03-03 16:23:49,448 INFO L78 Accepts]: Start accepts. Automaton has 35481 states and 67158 transitions. Word has length 79 [2025-03-03 16:23:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:49,449 INFO L471 AbstractCegarLoop]: Abstraction has 35481 states and 67158 transitions. [2025-03-03 16:23:49,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03 16:23:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 35481 states and 67158 transitions. [2025-03-03 16:23:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:49,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:49,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:23:49,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -20447087, now seen corresponding path program 1 times [2025-03-03 16:23:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729985447] [2025-03-03 16:23:49,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:49,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:49,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:49,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:49,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:49,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729985447] [2025-03-03 16:23:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729985447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:49,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508821257] [2025-03-03 16:23:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:49,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:49,551 INFO L87 Difference]: Start difference. First operand 35481 states and 67158 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:51,521 INFO L93 Difference]: Finished difference Result 37180 states and 69369 transitions. [2025-03-03 16:23:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-03 16:23:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:51,709 INFO L225 Difference]: With dead ends: 37180 [2025-03-03 16:23:51,710 INFO L226 Difference]: Without dead ends: 35541 [2025-03-03 16:23:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:51,741 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:51,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1895 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35541 states. [2025-03-03 16:23:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35541 to 35541. [2025-03-03 16:23:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35541 states, 29319 states have (on average 1.4462635151267096) internal successors, (42403), 32135 states have internal predecessors, (42403), 2166 states have call successors, (2166), 1289 states have call predecessors, (2166), 4054 states have return successors, (22643), 2246 states have call predecessors, (22643), 2164 states have call successors, (22643) [2025-03-03 16:23:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35541 states to 35541 states and 67212 transitions. [2025-03-03 16:23:54,180 INFO L78 Accepts]: Start accepts. Automaton has 35541 states and 67212 transitions. Word has length 92 [2025-03-03 16:23:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:54,180 INFO L471 AbstractCegarLoop]: Abstraction has 35541 states and 67212 transitions. [2025-03-03 16:23:54,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 35541 states and 67212 transitions. [2025-03-03 16:23:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:54,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:54,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:23:54,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 417562416, now seen corresponding path program 1 times [2025-03-03 16:23:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222145455] [2025-03-03 16:23:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:54,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:54,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:54,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:54,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222145455] [2025-03-03 16:23:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222145455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433097399] [2025-03-03 16:23:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:54,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:54,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:54,305 INFO L87 Difference]: Start difference. First operand 35541 states and 67212 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:56,984 INFO L93 Difference]: Finished difference Result 36989 states and 69051 transitions. [2025-03-03 16:23:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:23:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:23:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:57,135 INFO L225 Difference]: With dead ends: 36989 [2025-03-03 16:23:57,135 INFO L226 Difference]: Without dead ends: 35529 [2025-03-03 16:23:57,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:23:57,164 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 560 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:57,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 959 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35529 states. [2025-03-03 16:23:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35529 to 35319. [2025-03-03 16:23:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35319 states, 29150 states have (on average 1.4471355060034305) internal successors, (42184), 31961 states have internal predecessors, (42184), 2138 states have call successors, (2138), 1270 states have call predecessors, (2138), 4029 states have return successors, (22603), 2216 states have call predecessors, (22603), 2136 states have call successors, (22603) [2025-03-03 16:23:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 66925 transitions. [2025-03-03 16:23:59,606 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 66925 transitions. Word has length 92 [2025-03-03 16:23:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 35319 states and 66925 transitions. [2025-03-03 16:23:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 66925 transitions. [2025-03-03 16:23:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:59,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:59,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:23:59,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 409803057, now seen corresponding path program 1 times [2025-03-03 16:23:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963743514] [2025-03-03 16:23:59,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:59,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:59,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:59,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:23:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963743514] [2025-03-03 16:23:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963743514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:59,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:23:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912116297] [2025-03-03 16:23:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:59,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:23:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:59,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:23:59,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:59,659 INFO L87 Difference]: Start difference. First operand 35319 states and 66925 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:01,485 INFO L93 Difference]: Finished difference Result 38271 states and 70755 transitions. [2025-03-03 16:24:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:24:01,486 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-03-03 16:24:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:01,658 INFO L225 Difference]: With dead ends: 38271 [2025-03-03 16:24:01,658 INFO L226 Difference]: Without dead ends: 36795 [2025-03-03 16:24:01,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:01,684 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 487 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:01,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 484 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:24:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36795 states. [2025-03-03 16:24:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36795 to 36795. [2025-03-03 16:24:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36795 states, 30306 states have (on average 1.4392859499769022) internal successors, (43619), 33146 states have internal predecessors, (43619), 2299 states have call successors, (2299), 1383 states have call predecessors, (2299), 4188 states have return successors, (22886), 2395 states have call predecessors, (22886), 2297 states have call successors, (22886) [2025-03-03 16:24:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36795 states to 36795 states and 68804 transitions. [2025-03-03 16:24:03,870 INFO L78 Accepts]: Start accepts. Automaton has 36795 states and 68804 transitions. Word has length 92 [2025-03-03 16:24:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 36795 states and 68804 transitions. [2025-03-03 16:24:03,870 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36795 states and 68804 transitions. [2025-03-03 16:24:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:03,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:03,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:24:03,889 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:03,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1193182032, now seen corresponding path program 1 times [2025-03-03 16:24:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:03,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305902822] [2025-03-03 16:24:03,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:03,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:03,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:03,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:03,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305902822] [2025-03-03 16:24:03,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305902822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:03,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:03,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:03,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686663293] [2025-03-03 16:24:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:03,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:03,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:03,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:03,915 INFO L87 Difference]: Start difference. First operand 36795 states and 68804 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)