./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.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 453217a894ab839ac749d51e6f81154421ad61236b47a16877fbef21d8ae30a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:26:39,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:26:39,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:26:39,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:26:39,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:26:39,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:26:39,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:26:39,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:26:39,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:26:39,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:26:39,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:26:39,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:26:39,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:26:39,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:26:39,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:26:39,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:26:39,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:26:39,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:26:39,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:26:39,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:39,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:26:39,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:26:39,966 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 -> 453217a894ab839ac749d51e6f81154421ad61236b47a16877fbef21d8ae30a8 [2025-03-16 19:26:40,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:26:40,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:26:40,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:26:40,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:26:40,207 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:26:40,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:26:41,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b04aa28/3617e73f9391406a89b13b6a8e02ef58/FLAG95bf3f573 [2025-03-16 19:26:41,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:26:41,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:26:41,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b04aa28/3617e73f9391406a89b13b6a8e02ef58/FLAG95bf3f573 [2025-03-16 19:26:41,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b04aa28/3617e73f9391406a89b13b6a8e02ef58 [2025-03-16 19:26:41,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:26:41,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:26:41,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:41,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:26:41,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:26:41,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:41" (1/1) ... [2025-03-16 19:26:41,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:41, skipping insertion in model container [2025-03-16 19:26:41,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:41" (1/1) ... [2025-03-16 19:26:41,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:26:42,100 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7253,7266] [2025-03-16 19:26:42,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:42,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:26:42,187 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7253,7266] [2025-03-16 19:26:42,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:42,235 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:26:42,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42 WrapperNode [2025-03-16 19:26:42,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:42,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:42,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:26:42,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:26:42,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,292 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 710 [2025-03-16 19:26:42,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:42,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:26:42,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:26:42,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:26:42,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:26:42,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:26:42,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:26:42,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:26:42,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:26:42,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (1/1) ... [2025-03-16 19:26:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:42,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:26:42,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:26:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:26:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:26:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:26:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:26:42,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:26:42,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:26:43,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:43,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:26:43,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:43,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:43,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~2#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: havoc main_~node3__m3~2#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: havoc main_~node4__m4~2#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:43,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:43,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L662: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:43,140 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-03-16 19:26:43,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:26:43,154 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:26:43,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:26:43,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:43 BoogieIcfgContainer [2025-03-16 19:26:43,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:26:43,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:26:43,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:26:43,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:26:43,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:26:41" (1/3) ... [2025-03-16 19:26:43,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e02e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:43, skipping insertion in model container [2025-03-16 19:26:43,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:42" (2/3) ... [2025-03-16 19:26:43,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e02e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:43, skipping insertion in model container [2025-03-16 19:26:43,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:43" (3/3) ... [2025-03-16 19:26:43,164 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:26:43,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:26:43,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 170 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:26:43,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:26:43,226 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;@1031d8a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:26:43,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:26:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 168 states have (on average 1.7261904761904763) internal successors, (290), 169 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:26:43,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:43,238 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] [2025-03-16 19:26:43,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 450822211, now seen corresponding path program 1 times [2025-03-16 19:26:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767684706] [2025-03-16 19:26:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:43,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:26:43,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:26:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767684706] [2025-03-16 19:26:43,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767684706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:43,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:43,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868087776] [2025-03-16 19:26:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:43,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:43,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:43,780 INFO L87 Difference]: Start difference. First operand has 170 states, 168 states have (on average 1.7261904761904763) internal successors, (290), 169 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:43,988 INFO L93 Difference]: Finished difference Result 605 states and 980 transitions. [2025-03-16 19:26:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:43,991 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:26:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:43,999 INFO L225 Difference]: With dead ends: 605 [2025-03-16 19:26:44,001 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 19:26:44,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:44,006 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1382 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:44,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1733 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 19:26:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 260. [2025-03-16 19:26:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.501930501930502) internal successors, (389), 259 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2025-03-16 19:26:44,052 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 63 [2025-03-16 19:26:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:44,052 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2025-03-16 19:26:44,052 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2025-03-16 19:26:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:26:44,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:44,053 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] [2025-03-16 19:26:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:26:44,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:44,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1091547126, now seen corresponding path program 1 times [2025-03-16 19:26:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431353311] [2025-03-16 19:26:44,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:44,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:26:44,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:26:44,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:44,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431353311] [2025-03-16 19:26:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431353311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254839397] [2025-03-16 19:26:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:44,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:44,288 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:44,435 INFO L93 Difference]: Finished difference Result 968 states and 1485 transitions. [2025-03-16 19:26:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:26:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:44,439 INFO L225 Difference]: With dead ends: 968 [2025-03-16 19:26:44,441 INFO L226 Difference]: Without dead ends: 766 [2025-03-16 19:26:44,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:44,442 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 942 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:44,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 687 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-16 19:26:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 760. [2025-03-16 19:26:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.523056653491436) internal successors, (1156), 759 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1156 transitions. [2025-03-16 19:26:44,477 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1156 transitions. Word has length 64 [2025-03-16 19:26:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1156 transitions. [2025-03-16 19:26:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1156 transitions. [2025-03-16 19:26:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:44,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:44,481 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-16 19:26:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:26:44,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1705839553, now seen corresponding path program 1 times [2025-03-16 19:26:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694999298] [2025-03-16 19:26:44,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:44,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:44,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:44,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:44,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694999298] [2025-03-16 19:26:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694999298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058753337] [2025-03-16 19:26:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:44,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:44,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:44,642 INFO L87 Difference]: Start difference. First operand 760 states and 1156 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:44,827 INFO L93 Difference]: Finished difference Result 1922 states and 2966 transitions. [2025-03-16 19:26:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:26:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:44,834 INFO L225 Difference]: With dead ends: 1922 [2025-03-16 19:26:44,835 INFO L226 Difference]: Without dead ends: 1258 [2025-03-16 19:26:44,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:44,839 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 873 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:44,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 238 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-16 19:26:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2025-03-16 19:26:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1255 states have (on average 1.5314741035856574) internal successors, (1922), 1255 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1922 transitions. [2025-03-16 19:26:44,893 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1922 transitions. Word has length 65 [2025-03-16 19:26:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1922 transitions. [2025-03-16 19:26:44,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1922 transitions. [2025-03-16 19:26:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:44,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:44,898 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-16 19:26:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:26:44,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:44,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 677547629, now seen corresponding path program 1 times [2025-03-16 19:26:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103109777] [2025-03-16 19:26:44,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:44,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:44,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:44,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103109777] [2025-03-16 19:26:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103109777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842648649] [2025-03-16 19:26:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:45,028 INFO L87 Difference]: Start difference. First operand 1256 states and 1922 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:45,215 INFO L93 Difference]: Finished difference Result 3463 states and 5345 transitions. [2025-03-16 19:26:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:26:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:45,223 INFO L225 Difference]: With dead ends: 3463 [2025-03-16 19:26:45,223 INFO L226 Difference]: Without dead ends: 2276 [2025-03-16 19:26:45,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:45,226 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 899 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:45,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 236 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-16 19:26:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2274. [2025-03-16 19:26:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 1.5336559612846459) internal successors, (3486), 2273 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3486 transitions. [2025-03-16 19:26:45,285 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3486 transitions. Word has length 65 [2025-03-16 19:26:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:45,286 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3486 transitions. [2025-03-16 19:26:45,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3486 transitions. [2025-03-16 19:26:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:45,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:45,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:26:45,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:45,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1174480103, now seen corresponding path program 1 times [2025-03-16 19:26:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551696749] [2025-03-16 19:26:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:45,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:45,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:45,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:45,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551696749] [2025-03-16 19:26:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551696749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285198118] [2025-03-16 19:26:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:45,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:45,399 INFO L87 Difference]: Start difference. First operand 2274 states and 3486 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:45,591 INFO L93 Difference]: Finished difference Result 6560 states and 10110 transitions. [2025-03-16 19:26:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:26:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:45,605 INFO L225 Difference]: With dead ends: 6560 [2025-03-16 19:26:45,606 INFO L226 Difference]: Without dead ends: 4332 [2025-03-16 19:26:45,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:45,612 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 925 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:45,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 234 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2025-03-16 19:26:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4330. [2025-03-16 19:26:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.5308385308385308) internal successors, (6627), 4329 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6627 transitions. [2025-03-16 19:26:45,702 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6627 transitions. Word has length 65 [2025-03-16 19:26:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 6627 transitions. [2025-03-16 19:26:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6627 transitions. [2025-03-16 19:26:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:45,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:45,706 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-16 19:26:45,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:26:45,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:45,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2126191011, now seen corresponding path program 1 times [2025-03-16 19:26:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544672401] [2025-03-16 19:26:45,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:45,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:45,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544672401] [2025-03-16 19:26:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544672401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295779720] [2025-03-16 19:26:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:45,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:45,841 INFO L87 Difference]: Start difference. First operand 4330 states and 6627 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:46,036 INFO L93 Difference]: Finished difference Result 11798 states and 18110 transitions. [2025-03-16 19:26:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:26:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:46,057 INFO L225 Difference]: With dead ends: 11798 [2025-03-16 19:26:46,058 INFO L226 Difference]: Without dead ends: 7516 [2025-03-16 19:26:46,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:46,065 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 958 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:46,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 237 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-03-16 19:26:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7514. [2025-03-16 19:26:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.5268201783575137) internal successors, (11471), 7513 states have internal predecessors, (11471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 11471 transitions. [2025-03-16 19:26:46,205 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 11471 transitions. Word has length 66 [2025-03-16 19:26:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:46,206 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 11471 transitions. [2025-03-16 19:26:46,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 11471 transitions. [2025-03-16 19:26:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:46,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:46,213 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-16 19:26:46,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:26:46,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 832734488, now seen corresponding path program 1 times [2025-03-16 19:26:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138448777] [2025-03-16 19:26:46,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:46,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:46,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138448777] [2025-03-16 19:26:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138448777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:26:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675315327] [2025-03-16 19:26:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:46,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:46,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:46,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:46,446 INFO L87 Difference]: Start difference. First operand 7514 states and 11471 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:46,482 INFO L93 Difference]: Finished difference Result 7740 states and 11808 transitions. [2025-03-16 19:26:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:26:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:46,500 INFO L225 Difference]: With dead ends: 7740 [2025-03-16 19:26:46,501 INFO L226 Difference]: Without dead ends: 7738 [2025-03-16 19:26:46,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:46,505 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:46,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 910 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7738 states. [2025-03-16 19:26:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7738 to 7738. [2025-03-16 19:26:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 7737 states have (on average 1.5115677911335144) internal successors, (11695), 7737 states have internal predecessors, (11695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 11695 transitions. [2025-03-16 19:26:46,616 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 11695 transitions. Word has length 66 [2025-03-16 19:26:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:46,616 INFO L471 AbstractCegarLoop]: Abstraction has 7738 states and 11695 transitions. [2025-03-16 19:26:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 11695 transitions. [2025-03-16 19:26:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:46,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:46,618 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] [2025-03-16 19:26:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:26:46,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 49739073, now seen corresponding path program 1 times [2025-03-16 19:26:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645125513] [2025-03-16 19:26:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:46,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:46,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:46,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:46,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:46,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645125513] [2025-03-16 19:26:46,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645125513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:46,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:46,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:26:46,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291196751] [2025-03-16 19:26:46,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:46,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:26:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:46,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:26:46,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:46,853 INFO L87 Difference]: Start difference. First operand 7738 states and 11695 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,282 INFO L93 Difference]: Finished difference Result 10287 states and 15415 transitions. [2025-03-16 19:26:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:26:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,311 INFO L225 Difference]: With dead ends: 10287 [2025-03-16 19:26:47,311 INFO L226 Difference]: Without dead ends: 9075 [2025-03-16 19:26:47,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:47,314 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 590 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 709 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2025-03-16 19:26:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 7738. [2025-03-16 19:26:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 7737 states have (on average 1.51143854207057) internal successors, (11694), 7737 states have internal predecessors, (11694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 11694 transitions. [2025-03-16 19:26:47,412 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 11694 transitions. Word has length 67 [2025-03-16 19:26:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:47,412 INFO L471 AbstractCegarLoop]: Abstraction has 7738 states and 11694 transitions. [2025-03-16 19:26:47,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 11694 transitions. [2025-03-16 19:26:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:47,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:47,415 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] [2025-03-16 19:26:47,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:26:47,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:47,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1909645505, now seen corresponding path program 1 times [2025-03-16 19:26:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:47,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829257848] [2025-03-16 19:26:47,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:47,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:47,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829257848] [2025-03-16 19:26:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829257848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095443451] [2025-03-16 19:26:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:26:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:26:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:26:47,536 INFO L87 Difference]: Start difference. First operand 7738 states and 11694 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,578 INFO L93 Difference]: Finished difference Result 20878 states and 31496 transitions. [2025-03-16 19:26:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:26:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:26:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,602 INFO L225 Difference]: With dead ends: 20878 [2025-03-16 19:26:47,602 INFO L226 Difference]: Without dead ends: 13708 [2025-03-16 19:26:47,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:26:47,612 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 185 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 492 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13708 states. [2025-03-16 19:26:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13708 to 13706. [2025-03-16 19:26:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13706 states, 13705 states have (on average 1.4959503830718717) internal successors, (20502), 13705 states have internal predecessors, (20502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13706 states to 13706 states and 20502 transitions. [2025-03-16 19:26:47,815 INFO L78 Accepts]: Start accepts. Automaton has 13706 states and 20502 transitions. Word has length 67 [2025-03-16 19:26:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:47,816 INFO L471 AbstractCegarLoop]: Abstraction has 13706 states and 20502 transitions. [2025-03-16 19:26:47,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 20502 transitions. [2025-03-16 19:26:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:47,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:47,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:47,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:26:47,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:47,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1034237798, now seen corresponding path program 1 times [2025-03-16 19:26:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592997460] [2025-03-16 19:26:47,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:47,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592997460] [2025-03-16 19:26:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592997460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137542193] [2025-03-16 19:26:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:47,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:47,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:47,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:47,871 INFO L87 Difference]: Start difference. First operand 13706 states and 20502 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,938 INFO L93 Difference]: Finished difference Result 30454 states and 45582 transitions. [2025-03-16 19:26:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:26:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,971 INFO L225 Difference]: With dead ends: 30454 [2025-03-16 19:26:47,971 INFO L226 Difference]: Without dead ends: 18858 [2025-03-16 19:26:47,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:47,986 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 163 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 453 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18858 states. [2025-03-16 19:26:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18858 to 13696. [2025-03-16 19:26:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13696 states, 13695 states have (on average 1.4805403431909456) internal successors, (20276), 13695 states have internal predecessors, (20276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 20276 transitions. [2025-03-16 19:26:48,185 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 20276 transitions. Word has length 68 [2025-03-16 19:26:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:48,185 INFO L471 AbstractCegarLoop]: Abstraction has 13696 states and 20276 transitions. [2025-03-16 19:26:48,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 20276 transitions. [2025-03-16 19:26:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:48,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:48,187 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] [2025-03-16 19:26:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:26:48,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1606733063, now seen corresponding path program 1 times [2025-03-16 19:26:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-16 19:26:48,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:48,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:48,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:48,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-16 19:26:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360644123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518713897] [2025-03-16 19:26:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:48,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:48,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:48,240 INFO L87 Difference]: Start difference. First operand 13696 states and 20276 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:48,301 INFO L93 Difference]: Finished difference Result 28030 states and 41383 transitions. [2025-03-16 19:26:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:26:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:48,325 INFO L225 Difference]: With dead ends: 28030 [2025-03-16 19:26:48,325 INFO L226 Difference]: Without dead ends: 16490 [2025-03-16 19:26:48,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:48,339 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 155 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:48,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 438 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2025-03-16 19:26:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 16343. [2025-03-16 19:26:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16343 states, 16342 states have (on average 1.450923999510464) internal successors, (23711), 16342 states have internal predecessors, (23711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 23711 transitions. [2025-03-16 19:26:48,621 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 23711 transitions. Word has length 68 [2025-03-16 19:26:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:48,621 INFO L471 AbstractCegarLoop]: Abstraction has 16343 states and 23711 transitions. [2025-03-16 19:26:48,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 23711 transitions. [2025-03-16 19:26:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:48,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:48,623 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] [2025-03-16 19:26:48,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:26:48,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:48,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1030631802, now seen corresponding path program 1 times [2025-03-16 19:26:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474241373] [2025-03-16 19:26:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:48,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:48,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:48,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474241373] [2025-03-16 19:26:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474241373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283720481] [2025-03-16 19:26:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:48,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:48,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:48,707 INFO L87 Difference]: Start difference. First operand 16343 states and 23711 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:48,836 INFO L93 Difference]: Finished difference Result 36351 states and 53012 transitions. [2025-03-16 19:26:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:26:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:48,882 INFO L225 Difference]: With dead ends: 36351 [2025-03-16 19:26:48,882 INFO L226 Difference]: Without dead ends: 30925 [2025-03-16 19:26:48,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:48,897 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1048 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:48,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1051 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30925 states. [2025-03-16 19:26:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30925 to 21725. [2025-03-16 19:26:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21725 states, 21724 states have (on average 1.4498711102927637) internal successors, (31497), 21724 states have internal predecessors, (31497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21725 states to 21725 states and 31497 transitions. [2025-03-16 19:26:49,208 INFO L78 Accepts]: Start accepts. Automaton has 21725 states and 31497 transitions. Word has length 68 [2025-03-16 19:26:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:49,208 INFO L471 AbstractCegarLoop]: Abstraction has 21725 states and 31497 transitions. [2025-03-16 19:26:49,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21725 states and 31497 transitions. [2025-03-16 19:26:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:49,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:49,211 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] [2025-03-16 19:26:49,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:26:49,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:49,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash 701147801, now seen corresponding path program 1 times [2025-03-16 19:26:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:49,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-03-16 19:26:49,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:49,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:49,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:49,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:49,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-03-16 19:26:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213441188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219994395] [2025-03-16 19:26:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:49,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:49,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:49,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:49,261 INFO L87 Difference]: Start difference. First operand 21725 states and 31497 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:49,398 INFO L93 Difference]: Finished difference Result 33561 states and 48451 transitions. [2025-03-16 19:26:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:26:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:49,441 INFO L225 Difference]: With dead ends: 33561 [2025-03-16 19:26:49,441 INFO L226 Difference]: Without dead ends: 24707 [2025-03-16 19:26:49,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:49,456 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 134 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:49,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 443 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24707 states. [2025-03-16 19:26:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24707 to 20997. [2025-03-16 19:26:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20997 states, 20996 states have (on average 1.420413412078491) internal successors, (29823), 20996 states have internal predecessors, (29823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20997 states to 20997 states and 29823 transitions. [2025-03-16 19:26:49,767 INFO L78 Accepts]: Start accepts. Automaton has 20997 states and 29823 transitions. Word has length 68 [2025-03-16 19:26:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:49,768 INFO L471 AbstractCegarLoop]: Abstraction has 20997 states and 29823 transitions. [2025-03-16 19:26:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 20997 states and 29823 transitions. [2025-03-16 19:26:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:49,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:49,771 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] [2025-03-16 19:26:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:26:49,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 528906105, now seen corresponding path program 1 times [2025-03-16 19:26:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768695457] [2025-03-16 19:26:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:49,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:49,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:49,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:49,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768695457] [2025-03-16 19:26:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768695457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325902869] [2025-03-16 19:26:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:49,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:49,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:49,885 INFO L87 Difference]: Start difference. First operand 20997 states and 29823 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:50,059 INFO L93 Difference]: Finished difference Result 39661 states and 56731 transitions. [2025-03-16 19:26:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:26:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:50,120 INFO L225 Difference]: With dead ends: 39661 [2025-03-16 19:26:50,120 INFO L226 Difference]: Without dead ends: 33627 [2025-03-16 19:26:50,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:50,139 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1025 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:50,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1215 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33627 states. [2025-03-16 19:26:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33627 to 26983. [2025-03-16 19:26:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26983 states, 26982 states have (on average 1.4209472981987992) internal successors, (38340), 26982 states have internal predecessors, (38340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26983 states to 26983 states and 38340 transitions. [2025-03-16 19:26:50,584 INFO L78 Accepts]: Start accepts. Automaton has 26983 states and 38340 transitions. Word has length 68 [2025-03-16 19:26:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:50,584 INFO L471 AbstractCegarLoop]: Abstraction has 26983 states and 38340 transitions. [2025-03-16 19:26:50,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26983 states and 38340 transitions. [2025-03-16 19:26:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:26:50,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:50,587 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] [2025-03-16 19:26:50,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:26:50,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:50,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1175111038, now seen corresponding path program 1 times [2025-03-16 19:26:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871405304] [2025-03-16 19:26:50,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:50,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:26:50,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:26:50,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:50,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871405304] [2025-03-16 19:26:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871405304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:50,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172669401] [2025-03-16 19:26:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:50,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:50,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:50,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:50,666 INFO L87 Difference]: Start difference. First operand 26983 states and 38340 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:50,846 INFO L93 Difference]: Finished difference Result 47155 states and 67400 transitions. [2025-03-16 19:26:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:26:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:50,891 INFO L225 Difference]: With dead ends: 47155 [2025-03-16 19:26:50,891 INFO L226 Difference]: Without dead ends: 39593 [2025-03-16 19:26:50,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:50,907 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1031 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:50,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1059 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39593 states. [2025-03-16 19:26:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39593 to 31351. [2025-03-16 19:26:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31351 states, 31350 states have (on average 1.4214673046251993) internal successors, (44563), 31350 states have internal predecessors, (44563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31351 states to 31351 states and 44563 transitions. [2025-03-16 19:26:51,428 INFO L78 Accepts]: Start accepts. Automaton has 31351 states and 44563 transitions. Word has length 69 [2025-03-16 19:26:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:51,428 INFO L471 AbstractCegarLoop]: Abstraction has 31351 states and 44563 transitions. [2025-03-16 19:26:51,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31351 states and 44563 transitions. [2025-03-16 19:26:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:26:51,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:51,431 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] [2025-03-16 19:26:51,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:26:51,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:51,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1592941822, now seen corresponding path program 1 times [2025-03-16 19:26:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760131934] [2025-03-16 19:26:51,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:51,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:26:51,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:26:51,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:51,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760131934] [2025-03-16 19:26:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760131934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058760633] [2025-03-16 19:26:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:51,518 INFO L87 Difference]: Start difference. First operand 31351 states and 44563 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:51,669 INFO L93 Difference]: Finished difference Result 42433 states and 60466 transitions. [2025-03-16 19:26:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:26:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:51,716 INFO L225 Difference]: With dead ends: 42433 [2025-03-16 19:26:51,717 INFO L226 Difference]: Without dead ends: 41003 [2025-03-16 19:26:51,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:51,731 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1062 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:51,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1043 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41003 states. [2025-03-16 19:26:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41003 to 32765. [2025-03-16 19:26:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32765 states, 32764 states have (on average 1.4216518129654498) internal successors, (46579), 32764 states have internal predecessors, (46579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32765 states to 32765 states and 46579 transitions. [2025-03-16 19:26:52,191 INFO L78 Accepts]: Start accepts. Automaton has 32765 states and 46579 transitions. Word has length 69 [2025-03-16 19:26:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:52,191 INFO L471 AbstractCegarLoop]: Abstraction has 32765 states and 46579 transitions. [2025-03-16 19:26:52,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 32765 states and 46579 transitions. [2025-03-16 19:26:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:26:52,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:52,194 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] [2025-03-16 19:26:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:26:52,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1438928226, now seen corresponding path program 1 times [2025-03-16 19:26:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168098795] [2025-03-16 19:26:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:52,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:26:52,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:26:52,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:52,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168098795] [2025-03-16 19:26:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168098795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:52,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21235488] [2025-03-16 19:26:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:52,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:52,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:52,347 INFO L87 Difference]: Start difference. First operand 32765 states and 46579 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:52,521 INFO L93 Difference]: Finished difference Result 60046 states and 84996 transitions. [2025-03-16 19:26:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:26:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:52,577 INFO L225 Difference]: With dead ends: 60046 [2025-03-16 19:26:52,577 INFO L226 Difference]: Without dead ends: 34375 [2025-03-16 19:26:52,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:52,605 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:52,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 520 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34375 states. [2025-03-16 19:26:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34375 to 32089. [2025-03-16 19:26:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32089 states, 32088 states have (on average 1.3857205185739216) internal successors, (44465), 32088 states have internal predecessors, (44465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32089 states to 32089 states and 44465 transitions. [2025-03-16 19:26:53,183 INFO L78 Accepts]: Start accepts. Automaton has 32089 states and 44465 transitions. Word has length 71 [2025-03-16 19:26:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:53,183 INFO L471 AbstractCegarLoop]: Abstraction has 32089 states and 44465 transitions. [2025-03-16 19:26:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32089 states and 44465 transitions. [2025-03-16 19:26:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:26:53,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:53,187 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] [2025-03-16 19:26:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:26:53,187 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1893742976, now seen corresponding path program 1 times [2025-03-16 19:26:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674863778] [2025-03-16 19:26:53,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:26:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:26:53,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674863778] [2025-03-16 19:26:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674863778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:53,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548143506] [2025-03-16 19:26:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:53,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:53,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:53,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:53,269 INFO L87 Difference]: Start difference. First operand 32089 states and 44465 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:53,692 INFO L93 Difference]: Finished difference Result 78024 states and 107834 transitions. [2025-03-16 19:26:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:26:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:53,776 INFO L225 Difference]: With dead ends: 78024 [2025-03-16 19:26:53,776 INFO L226 Difference]: Without dead ends: 67651 [2025-03-16 19:26:53,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:53,806 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1695 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:53,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 452 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67651 states. [2025-03-16 19:26:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67651 to 32113. [2025-03-16 19:26:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32113 states, 32112 states have (on average 1.385681365221724) internal successors, (44497), 32112 states have internal predecessors, (44497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32113 states to 32113 states and 44497 transitions. [2025-03-16 19:26:54,345 INFO L78 Accepts]: Start accepts. Automaton has 32113 states and 44497 transitions. Word has length 73 [2025-03-16 19:26:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 32113 states and 44497 transitions. [2025-03-16 19:26:54,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 32113 states and 44497 transitions. [2025-03-16 19:26:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:26:54,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:54,350 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] [2025-03-16 19:26:54,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:26:54,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:54,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -918432394, now seen corresponding path program 1 times [2025-03-16 19:26:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:54,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946236194] [2025-03-16 19:26:54,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:54,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:26:54,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:26:54,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:54,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946236194] [2025-03-16 19:26:54,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946236194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:54,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:54,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853534405] [2025-03-16 19:26:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:54,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:54,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:54,535 INFO L87 Difference]: Start difference. First operand 32113 states and 44497 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:54,939 INFO L93 Difference]: Finished difference Result 76358 states and 104480 transitions. [2025-03-16 19:26:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:54,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:26:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:55,015 INFO L225 Difference]: With dead ends: 76358 [2025-03-16 19:26:55,015 INFO L226 Difference]: Without dead ends: 70442 [2025-03-16 19:26:55,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:55,043 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1313 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:55,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 430 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70442 states. [2025-03-16 19:26:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70442 to 32401. [2025-03-16 19:26:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32401 states, 32400 states have (on average 1.3841666666666668) internal successors, (44847), 32400 states have internal predecessors, (44847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32401 states to 32401 states and 44847 transitions. [2025-03-16 19:26:55,624 INFO L78 Accepts]: Start accepts. Automaton has 32401 states and 44847 transitions. Word has length 74 [2025-03-16 19:26:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:55,624 INFO L471 AbstractCegarLoop]: Abstraction has 32401 states and 44847 transitions. [2025-03-16 19:26:55,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32401 states and 44847 transitions. [2025-03-16 19:26:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:26:55,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:55,629 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] [2025-03-16 19:26:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:26:55,629 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1558153175, now seen corresponding path program 1 times [2025-03-16 19:26:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440745799] [2025-03-16 19:26:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:26:55,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:26:55,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:55,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440745799] [2025-03-16 19:26:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440745799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985338531] [2025-03-16 19:26:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:55,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:55,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:55,755 INFO L87 Difference]: Start difference. First operand 32401 states and 44847 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:56,194 INFO L93 Difference]: Finished difference Result 83071 states and 113761 transitions. [2025-03-16 19:26:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:56,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:26:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:56,268 INFO L225 Difference]: With dead ends: 83071 [2025-03-16 19:26:56,268 INFO L226 Difference]: Without dead ends: 61729 [2025-03-16 19:26:56,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:56,297 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1154 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:56,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 392 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61729 states. [2025-03-16 19:26:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61729 to 32441. [2025-03-16 19:26:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32441 states, 32440 states have (on average 1.3839395807644883) internal successors, (44895), 32440 states have internal predecessors, (44895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32441 states to 32441 states and 44895 transitions. [2025-03-16 19:26:56,885 INFO L78 Accepts]: Start accepts. Automaton has 32441 states and 44895 transitions. Word has length 74 [2025-03-16 19:26:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:56,886 INFO L471 AbstractCegarLoop]: Abstraction has 32441 states and 44895 transitions. [2025-03-16 19:26:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32441 states and 44895 transitions. [2025-03-16 19:26:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:26:56,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:56,891 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] [2025-03-16 19:26:56,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:26:56,891 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:56,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1352549511, now seen corresponding path program 1 times [2025-03-16 19:26:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950234063] [2025-03-16 19:26:56,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:26:56,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:26:56,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:56,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950234063] [2025-03-16 19:26:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950234063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23253028] [2025-03-16 19:26:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:57,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:57,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:57,086 INFO L87 Difference]: Start difference. First operand 32441 states and 44895 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:57,553 INFO L93 Difference]: Finished difference Result 96375 states and 132351 transitions. [2025-03-16 19:26:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:26:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:57,653 INFO L225 Difference]: With dead ends: 96375 [2025-03-16 19:26:57,653 INFO L226 Difference]: Without dead ends: 84611 [2025-03-16 19:26:57,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:57,685 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1538 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:57,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 435 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84611 states. [2025-03-16 19:26:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84611 to 32615. [2025-03-16 19:26:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32615 states, 32614 states have (on average 1.383301649598332) internal successors, (45115), 32614 states have internal predecessors, (45115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32615 states to 32615 states and 45115 transitions. [2025-03-16 19:26:58,325 INFO L78 Accepts]: Start accepts. Automaton has 32615 states and 45115 transitions. Word has length 74 [2025-03-16 19:26:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:58,325 INFO L471 AbstractCegarLoop]: Abstraction has 32615 states and 45115 transitions. [2025-03-16 19:26:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32615 states and 45115 transitions. [2025-03-16 19:26:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:58,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:58,330 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] [2025-03-16 19:26:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:26:58,331 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash -339112940, now seen corresponding path program 1 times [2025-03-16 19:26:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310512612] [2025-03-16 19:26:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:58,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:58,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:58,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310512612] [2025-03-16 19:26:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310512612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:26:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866107278] [2025-03-16 19:26:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:58,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:26:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:58,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:26:58,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:58,502 INFO L87 Difference]: Start difference. First operand 32615 states and 45115 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:59,082 INFO L93 Difference]: Finished difference Result 92023 states and 127402 transitions. [2025-03-16 19:26:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:26:59,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:26:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:59,158 INFO L225 Difference]: With dead ends: 92023 [2025-03-16 19:26:59,158 INFO L226 Difference]: Without dead ends: 60665 [2025-03-16 19:26:59,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:26:59,313 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 986 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:59,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 877 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60665 states. [2025-03-16 19:26:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60665 to 32404. [2025-03-16 19:26:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32404 states, 32403 states have (on average 1.3827423386723452) internal successors, (44805), 32403 states have internal predecessors, (44805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32404 states to 32404 states and 44805 transitions. [2025-03-16 19:26:59,989 INFO L78 Accepts]: Start accepts. Automaton has 32404 states and 44805 transitions. Word has length 76 [2025-03-16 19:26:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:59,990 INFO L471 AbstractCegarLoop]: Abstraction has 32404 states and 44805 transitions. [2025-03-16 19:26:59,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32404 states and 44805 transitions. [2025-03-16 19:26:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:59,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:59,994 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] [2025-03-16 19:26:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:26:59,994 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1647992844, now seen corresponding path program 1 times [2025-03-16 19:26:59,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:59,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091864699] [2025-03-16 19:26:59,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:00,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:00,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:00,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091864699] [2025-03-16 19:27:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091864699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:00,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:00,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832894371] [2025-03-16 19:27:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:00,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:00,161 INFO L87 Difference]: Start difference. First operand 32404 states and 44805 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:00,708 INFO L93 Difference]: Finished difference Result 81161 states and 112134 transitions. [2025-03-16 19:27:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:27:00,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:27:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:00,769 INFO L225 Difference]: With dead ends: 81161 [2025-03-16 19:27:00,769 INFO L226 Difference]: Without dead ends: 53069 [2025-03-16 19:27:00,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:27:00,799 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 612 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:00,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 830 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53069 states. [2025-03-16 19:27:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53069 to 32314. [2025-03-16 19:27:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32314 states, 32313 states have (on average 1.3818277473462692) internal successors, (44651), 32313 states have internal predecessors, (44651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32314 states to 32314 states and 44651 transitions. [2025-03-16 19:27:01,338 INFO L78 Accepts]: Start accepts. Automaton has 32314 states and 44651 transitions. Word has length 76 [2025-03-16 19:27:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:01,338 INFO L471 AbstractCegarLoop]: Abstraction has 32314 states and 44651 transitions. [2025-03-16 19:27:01,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32314 states and 44651 transitions. [2025-03-16 19:27:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:01,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:01,342 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] [2025-03-16 19:27:01,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:27:01,343 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:01,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1098064822, now seen corresponding path program 1 times [2025-03-16 19:27:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120299562] [2025-03-16 19:27:01,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:01,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:01,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:01,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:01,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120299562] [2025-03-16 19:27:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120299562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:27:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770614990] [2025-03-16 19:27:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:27:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:01,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:27:01,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:01,508 INFO L87 Difference]: Start difference. First operand 32314 states and 44651 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:02,084 INFO L93 Difference]: Finished difference Result 67834 states and 93734 transitions. [2025-03-16 19:27:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:27:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:27:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:02,131 INFO L225 Difference]: With dead ends: 67834 [2025-03-16 19:27:02,132 INFO L226 Difference]: Without dead ends: 48102 [2025-03-16 19:27:02,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:27:02,146 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 635 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:02,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 804 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48102 states. [2025-03-16 19:27:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48102 to 32299. [2025-03-16 19:27:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32299 states, 32298 states have (on average 1.3805189175800359) internal successors, (44588), 32298 states have internal predecessors, (44588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32299 states to 32299 states and 44588 transitions. [2025-03-16 19:27:02,665 INFO L78 Accepts]: Start accepts. Automaton has 32299 states and 44588 transitions. Word has length 76 [2025-03-16 19:27:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:02,665 INFO L471 AbstractCegarLoop]: Abstraction has 32299 states and 44588 transitions. [2025-03-16 19:27:02,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32299 states and 44588 transitions. [2025-03-16 19:27:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:27:02,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:02,669 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] [2025-03-16 19:27:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:27:02,669 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:02,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1683892453, now seen corresponding path program 1 times [2025-03-16 19:27:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949057807] [2025-03-16 19:27:02,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:02,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:27:02,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:27:02,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:02,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949057807] [2025-03-16 19:27:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949057807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27718689] [2025-03-16 19:27:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:03,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:03,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:03,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:03,234 INFO L87 Difference]: Start difference. First operand 32299 states and 44588 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:03,923 INFO L93 Difference]: Finished difference Result 68968 states and 95351 transitions. [2025-03-16 19:27:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:27:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:27:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:03,993 INFO L225 Difference]: With dead ends: 68968 [2025-03-16 19:27:03,993 INFO L226 Difference]: Without dead ends: 60457 [2025-03-16 19:27:04,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:04,016 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1437 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:04,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 1961 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60457 states. [2025-03-16 19:27:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60457 to 32276. [2025-03-16 19:27:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32276 states, 32275 states have (on average 1.3805112316034083) internal successors, (44556), 32275 states have internal predecessors, (44556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32276 states to 32276 states and 44556 transitions. [2025-03-16 19:27:04,547 INFO L78 Accepts]: Start accepts. Automaton has 32276 states and 44556 transitions. Word has length 76 [2025-03-16 19:27:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:04,547 INFO L471 AbstractCegarLoop]: Abstraction has 32276 states and 44556 transitions. [2025-03-16 19:27:04,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32276 states and 44556 transitions. [2025-03-16 19:27:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:27:04,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:04,551 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] [2025-03-16 19:27:04,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:27:04,551 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:04,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2031744828, now seen corresponding path program 1 times [2025-03-16 19:27:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550562470] [2025-03-16 19:27:04,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:04,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:27:04,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:27:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550562470] [2025-03-16 19:27:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550562470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:05,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:05,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090304900] [2025-03-16 19:27:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:05,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:05,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:05,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:05,017 INFO L87 Difference]: Start difference. First operand 32276 states and 44556 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:05,781 INFO L93 Difference]: Finished difference Result 104102 states and 143638 transitions. [2025-03-16 19:27:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:27:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:27:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:05,902 INFO L225 Difference]: With dead ends: 104102 [2025-03-16 19:27:05,902 INFO L226 Difference]: Without dead ends: 100100 [2025-03-16 19:27:05,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:05,940 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1662 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:05,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2163 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100100 states. [2025-03-16 19:27:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100100 to 31587. [2025-03-16 19:27:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31587 states, 31586 states have (on average 1.3811498765275756) internal successors, (43625), 31586 states have internal predecessors, (43625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31587 states to 31587 states and 43625 transitions. [2025-03-16 19:27:06,692 INFO L78 Accepts]: Start accepts. Automaton has 31587 states and 43625 transitions. Word has length 77 [2025-03-16 19:27:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:06,693 INFO L471 AbstractCegarLoop]: Abstraction has 31587 states and 43625 transitions. [2025-03-16 19:27:06,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31587 states and 43625 transitions. [2025-03-16 19:27:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:27:06,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:06,696 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] [2025-03-16 19:27:06,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:27:06,696 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:06,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1455282932, now seen corresponding path program 1 times [2025-03-16 19:27:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189734296] [2025-03-16 19:27:06,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:06,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:27:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:27:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:06,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189734296] [2025-03-16 19:27:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189734296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:06,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:06,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068550441] [2025-03-16 19:27:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:06,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:06,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:06,728 INFO L87 Difference]: Start difference. First operand 31587 states and 43625 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:06,877 INFO L93 Difference]: Finished difference Result 70038 states and 96832 transitions. [2025-03-16 19:27:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:06,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:27:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:06,939 INFO L225 Difference]: With dead ends: 70038 [2025-03-16 19:27:06,939 INFO L226 Difference]: Without dead ends: 49764 [2025-03-16 19:27:06,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:06,966 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 182 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:06,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 350 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49764 states. [2025-03-16 19:27:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49764 to 49571. [2025-03-16 19:27:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49571 states, 49570 states have (on average 1.3843655436756102) internal successors, (68623), 49570 states have internal predecessors, (68623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49571 states to 49571 states and 68623 transitions. [2025-03-16 19:27:07,778 INFO L78 Accepts]: Start accepts. Automaton has 49571 states and 68623 transitions. Word has length 77 [2025-03-16 19:27:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:07,779 INFO L471 AbstractCegarLoop]: Abstraction has 49571 states and 68623 transitions. [2025-03-16 19:27:07,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49571 states and 68623 transitions. [2025-03-16 19:27:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:07,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:07,784 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] [2025-03-16 19:27:07,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:27:07,784 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:07,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1900868602, now seen corresponding path program 1 times [2025-03-16 19:27:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:07,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140598555] [2025-03-16 19:27:07,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:07,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:07,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:07,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:07,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140598555] [2025-03-16 19:27:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140598555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:07,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628093923] [2025-03-16 19:27:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:07,826 INFO L87 Difference]: Start difference. First operand 49571 states and 68623 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:08,220 INFO L93 Difference]: Finished difference Result 99034 states and 137191 transitions. [2025-03-16 19:27:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:27:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:08,307 INFO L225 Difference]: With dead ends: 99034 [2025-03-16 19:27:08,307 INFO L226 Difference]: Without dead ends: 65631 [2025-03-16 19:27:08,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:08,337 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 163 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:08,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 337 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65631 states. [2025-03-16 19:27:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65631 to 43735. [2025-03-16 19:27:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43735 states, 43734 states have (on average 1.3850322403621895) internal successors, (60573), 43734 states have internal predecessors, (60573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43735 states to 43735 states and 60573 transitions. [2025-03-16 19:27:09,033 INFO L78 Accepts]: Start accepts. Automaton has 43735 states and 60573 transitions. Word has length 78 [2025-03-16 19:27:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:09,034 INFO L471 AbstractCegarLoop]: Abstraction has 43735 states and 60573 transitions. [2025-03-16 19:27:09,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43735 states and 60573 transitions. [2025-03-16 19:27:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:27:09,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:09,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:09,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:27:09,038 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:09,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1771716459, now seen corresponding path program 1 times [2025-03-16 19:27:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:09,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281141800] [2025-03-16 19:27:09,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:09,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:09,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:27:09,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:27:09,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:09,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281141800] [2025-03-16 19:27:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281141800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462094826] [2025-03-16 19:27:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:09,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:09,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:09,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:09,080 INFO L87 Difference]: Start difference. First operand 43735 states and 60573 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:09,193 INFO L93 Difference]: Finished difference Result 60477 states and 83453 transitions. [2025-03-16 19:27:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:27:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:09,239 INFO L225 Difference]: With dead ends: 60477 [2025-03-16 19:27:09,239 INFO L226 Difference]: Without dead ends: 41036 [2025-03-16 19:27:09,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:09,260 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 158 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:09,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 566 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41036 states. [2025-03-16 19:27:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41036 to 41034. [2025-03-16 19:27:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41034 states, 41033 states have (on average 1.3676309312017156) internal successors, (56118), 41033 states have internal predecessors, (56118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41034 states to 41034 states and 56118 transitions. [2025-03-16 19:27:09,816 INFO L78 Accepts]: Start accepts. Automaton has 41034 states and 56118 transitions. Word has length 80 [2025-03-16 19:27:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 41034 states and 56118 transitions. [2025-03-16 19:27:09,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 41034 states and 56118 transitions. [2025-03-16 19:27:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:27:09,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:09,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:27:09,821 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1100840863, now seen corresponding path program 1 times [2025-03-16 19:27:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124979909] [2025-03-16 19:27:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:27:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:27:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124979909] [2025-03-16 19:27:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124979909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723967596] [2025-03-16 19:27:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:09,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:09,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:09,861 INFO L87 Difference]: Start difference. First operand 41034 states and 56118 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:09,975 INFO L93 Difference]: Finished difference Result 52420 states and 71513 transitions. [2025-03-16 19:27:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:27:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:10,017 INFO L225 Difference]: With dead ends: 52420 [2025-03-16 19:27:10,017 INFO L226 Difference]: Without dead ends: 36410 [2025-03-16 19:27:10,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:10,037 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 131 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:10,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 523 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36410 states. [2025-03-16 19:27:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36410 to 36408. [2025-03-16 19:27:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36408 states, 36407 states have (on average 1.353970390309556) internal successors, (49294), 36407 states have internal predecessors, (49294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36408 states to 36408 states and 49294 transitions. [2025-03-16 19:27:10,626 INFO L78 Accepts]: Start accepts. Automaton has 36408 states and 49294 transitions. Word has length 81 [2025-03-16 19:27:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:10,626 INFO L471 AbstractCegarLoop]: Abstraction has 36408 states and 49294 transitions. [2025-03-16 19:27:10,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 36408 states and 49294 transitions. [2025-03-16 19:27:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:27:10,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:10,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:10,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:27:10,632 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:10,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash -273036788, now seen corresponding path program 1 times [2025-03-16 19:27:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:10,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829789171] [2025-03-16 19:27:10,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:10,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:10,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:10,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:10,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:10,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829789171] [2025-03-16 19:27:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829789171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652813722] [2025-03-16 19:27:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:10,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:10,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:10,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:10,672 INFO L87 Difference]: Start difference. First operand 36408 states and 49294 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:10,846 INFO L93 Difference]: Finished difference Result 71616 states and 97099 transitions. [2025-03-16 19:27:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:10,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:27:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:10,901 INFO L225 Difference]: With dead ends: 71616 [2025-03-16 19:27:10,901 INFO L226 Difference]: Without dead ends: 49846 [2025-03-16 19:27:10,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:10,927 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 164 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:10,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 340 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49846 states. [2025-03-16 19:27:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49846 to 35544. [2025-03-16 19:27:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35544 states, 35543 states have (on average 1.351827364037926) internal successors, (48048), 35543 states have internal predecessors, (48048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35544 states to 35544 states and 48048 transitions. [2025-03-16 19:27:11,464 INFO L78 Accepts]: Start accepts. Automaton has 35544 states and 48048 transitions. Word has length 82 [2025-03-16 19:27:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 35544 states and 48048 transitions. [2025-03-16 19:27:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 35544 states and 48048 transitions. [2025-03-16 19:27:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:27:11,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:11,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:11,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:27:11,469 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2003008237, now seen corresponding path program 1 times [2025-03-16 19:27:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941692910] [2025-03-16 19:27:11,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:11,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:11,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:11,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941692910] [2025-03-16 19:27:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941692910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-16 19:27:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949150150] [2025-03-16 19:27:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:12,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:27:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:12,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:27:12,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:27:12,421 INFO L87 Difference]: Start difference. First operand 35544 states and 48048 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:14,020 INFO L93 Difference]: Finished difference Result 66562 states and 89977 transitions. [2025-03-16 19:27:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:27:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:27:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:14,098 INFO L225 Difference]: With dead ends: 66562 [2025-03-16 19:27:14,099 INFO L226 Difference]: Without dead ends: 65438 [2025-03-16 19:27:14,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:27:14,124 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1225 mSDsluCounter, 4236 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 4544 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:14,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 4544 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:27:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65438 states. [2025-03-16 19:27:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65438 to 35555. [2025-03-16 19:27:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35555 states, 35554 states have (on average 1.3518028913764977) internal successors, (48062), 35554 states have internal predecessors, (48062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35555 states to 35555 states and 48062 transitions. [2025-03-16 19:27:14,620 INFO L78 Accepts]: Start accepts. Automaton has 35555 states and 48062 transitions. Word has length 82 [2025-03-16 19:27:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 35555 states and 48062 transitions. [2025-03-16 19:27:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35555 states and 48062 transitions. [2025-03-16 19:27:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:27:14,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:14,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:14,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:27:14,624 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:14,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1661038239, now seen corresponding path program 1 times [2025-03-16 19:27:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616552580] [2025-03-16 19:27:14,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:14,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:27:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:27:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616552580] [2025-03-16 19:27:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616552580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:15,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:27:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989644743] [2025-03-16 19:27:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:27:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:15,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:27:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:27:15,425 INFO L87 Difference]: Start difference. First operand 35555 states and 48062 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:16,775 INFO L93 Difference]: Finished difference Result 80753 states and 109123 transitions. [2025-03-16 19:27:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:27:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:27:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:16,859 INFO L225 Difference]: With dead ends: 80753 [2025-03-16 19:27:16,859 INFO L226 Difference]: Without dead ends: 77524 [2025-03-16 19:27:16,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:27:16,881 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1643 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:16,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 3585 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77524 states. [2025-03-16 19:27:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77524 to 35556. [2025-03-16 19:27:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35556 states, 35555 states have (on average 1.3518211222050345) internal successors, (48064), 35555 states have internal predecessors, (48064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35556 states to 35556 states and 48064 transitions. [2025-03-16 19:27:17,430 INFO L78 Accepts]: Start accepts. Automaton has 35556 states and 48064 transitions. Word has length 83 [2025-03-16 19:27:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:17,430 INFO L471 AbstractCegarLoop]: Abstraction has 35556 states and 48064 transitions. [2025-03-16 19:27:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35556 states and 48064 transitions. [2025-03-16 19:27:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:27:17,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:17,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:17,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:27:17,434 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1168644381, now seen corresponding path program 1 times [2025-03-16 19:27:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032554702] [2025-03-16 19:27:17,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:17,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:27:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:27:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032554702] [2025-03-16 19:27:17,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032554702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:17,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:17,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:27:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357041984] [2025-03-16 19:27:17,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:17,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:27:17,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:17,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:27:17,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:17,768 INFO L87 Difference]: Start difference. First operand 35556 states and 48064 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:18,333 INFO L93 Difference]: Finished difference Result 68765 states and 93321 transitions. [2025-03-16 19:27:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:27:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:27:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:18,406 INFO L225 Difference]: With dead ends: 68765 [2025-03-16 19:27:18,406 INFO L226 Difference]: Without dead ends: 59882 [2025-03-16 19:27:18,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:27:18,430 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 978 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:18,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 2298 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59882 states. [2025-03-16 19:27:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59882 to 35498. [2025-03-16 19:27:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35498 states, 35497 states have (on average 1.352001577598107) internal successors, (47992), 35497 states have internal predecessors, (47992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35498 states to 35498 states and 47992 transitions. [2025-03-16 19:27:19,078 INFO L78 Accepts]: Start accepts. Automaton has 35498 states and 47992 transitions. Word has length 83 [2025-03-16 19:27:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:19,078 INFO L471 AbstractCegarLoop]: Abstraction has 35498 states and 47992 transitions. [2025-03-16 19:27:19,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35498 states and 47992 transitions. [2025-03-16 19:27:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:27:19,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:19,087 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:27:19,087 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:19,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1067475943, now seen corresponding path program 1 times [2025-03-16 19:27:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686100758] [2025-03-16 19:27:19,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:19,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:27:19,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:27:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:19,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686100758] [2025-03-16 19:27:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686100758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801417476] [2025-03-16 19:27:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:19,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:19,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:19,169 INFO L87 Difference]: Start difference. First operand 35498 states and 47992 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:19,308 INFO L93 Difference]: Finished difference Result 75528 states and 102702 transitions. [2025-03-16 19:27:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:27:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:19,368 INFO L225 Difference]: With dead ends: 75528 [2025-03-16 19:27:19,368 INFO L226 Difference]: Without dead ends: 54872 [2025-03-16 19:27:19,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:19,393 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 118 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:19,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 479 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54872 states. [2025-03-16 19:27:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54872 to 52890. [2025-03-16 19:27:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52890 states, 52889 states have (on average 1.3534761481593527) internal successors, (71584), 52889 states have internal predecessors, (71584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52890 states to 52890 states and 71584 transitions. [2025-03-16 19:27:19,904 INFO L78 Accepts]: Start accepts. Automaton has 52890 states and 71584 transitions. Word has length 90 [2025-03-16 19:27:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:19,904 INFO L471 AbstractCegarLoop]: Abstraction has 52890 states and 71584 transitions. [2025-03-16 19:27:19,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 52890 states and 71584 transitions. [2025-03-16 19:27:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:27:19,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:19,909 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:19,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:27:19,909 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1881321353, now seen corresponding path program 1 times [2025-03-16 19:27:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434244058] [2025-03-16 19:27:19,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:19,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:27:19,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:27:19,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:19,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:19,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434244058] [2025-03-16 19:27:19,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434244058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:19,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:19,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744005258] [2025-03-16 19:27:19,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:19,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:27:19,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:19,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:27:19,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:19,981 INFO L87 Difference]: Start difference. First operand 52890 states and 71584 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:20,495 INFO L93 Difference]: Finished difference Result 155111 states and 210900 transitions. [2025-03-16 19:27:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:27:20,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:27:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:20,679 INFO L225 Difference]: With dead ends: 155111 [2025-03-16 19:27:20,679 INFO L226 Difference]: Without dead ends: 134380 [2025-03-16 19:27:20,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:20,750 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1423 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:20,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 415 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134380 states. [2025-03-16 19:27:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134380 to 74530. [2025-03-16 19:27:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74530 states, 74529 states have (on average 1.3557138831864106) internal successors, (101040), 74529 states have internal predecessors, (101040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74530 states to 74530 states and 101040 transitions. [2025-03-16 19:27:22,040 INFO L78 Accepts]: Start accepts. Automaton has 74530 states and 101040 transitions. Word has length 96 [2025-03-16 19:27:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:22,040 INFO L471 AbstractCegarLoop]: Abstraction has 74530 states and 101040 transitions. [2025-03-16 19:27:22,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 74530 states and 101040 transitions. [2025-03-16 19:27:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:27:22,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:22,046 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:22,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:27:22,047 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2077434006, now seen corresponding path program 1 times [2025-03-16 19:27:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305010603] [2025-03-16 19:27:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:22,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:27:22,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:27:22,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305010603] [2025-03-16 19:27:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305010603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290900879] [2025-03-16 19:27:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:27:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:22,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:27:22,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:27:22,128 INFO L87 Difference]: Start difference. First operand 74530 states and 101040 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:22,635 INFO L93 Difference]: Finished difference Result 135261 states and 183135 transitions. [2025-03-16 19:27:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:27:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:27:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:22,732 INFO L225 Difference]: With dead ends: 135261 [2025-03-16 19:27:22,732 INFO L226 Difference]: Without dead ends: 71884 [2025-03-16 19:27:22,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:27:22,787 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1539 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:22,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 428 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71884 states. [2025-03-16 19:27:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71884 to 55470. [2025-03-16 19:27:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55470 states, 55469 states have (on average 1.3511871495790442) internal successors, (74949), 55469 states have internal predecessors, (74949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55470 states to 55470 states and 74949 transitions. [2025-03-16 19:27:23,648 INFO L78 Accepts]: Start accepts. Automaton has 55470 states and 74949 transitions. Word has length 97 [2025-03-16 19:27:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:23,648 INFO L471 AbstractCegarLoop]: Abstraction has 55470 states and 74949 transitions. [2025-03-16 19:27:23,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 55470 states and 74949 transitions. [2025-03-16 19:27:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:27:23,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:23,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:23,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:27:23,662 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2050052486, now seen corresponding path program 1 times [2025-03-16 19:27:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580716912] [2025-03-16 19:27:23,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:23,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:27:23,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:27:23,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:23,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:27:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:23,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580716912] [2025-03-16 19:27:23,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580716912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:23,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589651233] [2025-03-16 19:27:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:23,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:23,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:23,755 INFO L87 Difference]: Start difference. First operand 55470 states and 74949 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:24,035 INFO L93 Difference]: Finished difference Result 132931 states and 178969 transitions. [2025-03-16 19:27:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:27:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:24,121 INFO L225 Difference]: With dead ends: 132931 [2025-03-16 19:27:24,122 INFO L226 Difference]: Without dead ends: 78496 [2025-03-16 19:27:24,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:24,170 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:24,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 465 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78496 states. [2025-03-16 19:27:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78496 to 74563. [2025-03-16 19:27:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74563 states, 74562 states have (on average 1.3319653442772459) internal successors, (99314), 74562 states have internal predecessors, (99314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74563 states to 74563 states and 99314 transitions. [2025-03-16 19:27:25,182 INFO L78 Accepts]: Start accepts. Automaton has 74563 states and 99314 transitions. Word has length 112 [2025-03-16 19:27:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:25,182 INFO L471 AbstractCegarLoop]: Abstraction has 74563 states and 99314 transitions. [2025-03-16 19:27:25,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 74563 states and 99314 transitions. [2025-03-16 19:27:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:27:25,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:25,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:25,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:27:25,195 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:25,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2099858009, now seen corresponding path program 1 times [2025-03-16 19:27:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607461017] [2025-03-16 19:27:25,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:27:25,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:27:25,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:25,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:27:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607461017] [2025-03-16 19:27:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607461017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450596406] [2025-03-16 19:27:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:25,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:25,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:25,256 INFO L87 Difference]: Start difference. First operand 74563 states and 99314 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:25,654 INFO L93 Difference]: Finished difference Result 201913 states and 268684 transitions. [2025-03-16 19:27:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:27:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:25,820 INFO L225 Difference]: With dead ends: 201913 [2025-03-16 19:27:25,820 INFO L226 Difference]: Without dead ends: 128289 [2025-03-16 19:27:25,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:25,890 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 97 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:25,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 458 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128289 states. [2025-03-16 19:27:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128289 to 113977. [2025-03-16 19:27:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113977 states, 113976 states have (on average 1.3221818628483188) internal successors, (150697), 113976 states have internal predecessors, (150697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)