./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.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.7.1.ufo.UNBOUNDED.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 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:36:39,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:36:39,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:36:39,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:36:39,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:36:39,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:36:39,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:36:39,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:36:39,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:36:39,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:36:39,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:36:39,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:36:39,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:36:39,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:36:39,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:36:39,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:36:39,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:39,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:36:39,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:36:39,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:36:39,782 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 -> 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d [2025-03-16 19:36:39,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:36:39,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:36:39,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:36:39,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:36:39,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:36:39,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:36:41,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f475a6c0f/393641d0e9194c3ab049cff8d1d23db1/FLAG22493244b [2025-03-16 19:36:41,397 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:36:41,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:36:41,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f475a6c0f/393641d0e9194c3ab049cff8d1d23db1/FLAG22493244b [2025-03-16 19:36:41,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f475a6c0f/393641d0e9194c3ab049cff8d1d23db1 [2025-03-16 19:36:41,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:36:41,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:36:41,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:41,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:36:41,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:36:41,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:41" (1/1) ... [2025-03-16 19:36:41,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b739f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:41, skipping insertion in model container [2025-03-16 19:36:41,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:41" (1/1) ... [2025-03-16 19:36:41,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:36:41,916 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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-16 19:36:41,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:41,997 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:36:42,033 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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-16 19:36:42,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:42,076 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:36:42,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42 WrapperNode [2025-03-16 19:36:42,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:42,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:42,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:36:42,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:36:42,082 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:36:42" (1/1) ... [2025-03-16 19:36:42,093 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:36:42" (1/1) ... [2025-03-16 19:36:42,139 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 904 [2025-03-16 19:36:42,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:42,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:36:42,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:36:42,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:36:42,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,164 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:36:42,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:36:42,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:36:42,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:36:42,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:36:42,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:42,207 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:36:42,211 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:36:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:36:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:36:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:36:42,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:36:42,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:36:42,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3__m3~2#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node2__m2~2#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L507: havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~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_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;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:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,970 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node5__m5~2#1; [2025-03-16 19:36:42,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:36:42,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L910: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:42,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-16 19:36:42,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node4__m4~2#1; [2025-03-16 19:36:43,006 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-16 19:36:43,006 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:36:43,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:36:43,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:36:43,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:43 BoogieIcfgContainer [2025-03-16 19:36:43,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:36:43,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:36:43,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:36:43,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:36:43,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:36:41" (1/3) ... [2025-03-16 19:36:43,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a874069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:43, skipping insertion in model container [2025-03-16 19:36:43,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (2/3) ... [2025-03-16 19:36:43,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a874069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:43, skipping insertion in model container [2025-03-16 19:36:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:43" (3/3) ... [2025-03-16 19:36:43,029 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:36:43,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:36:43,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 200 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:36:43,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:36:43,105 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;@16767149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:36:43,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:36:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 198 states have (on average 1.7676767676767677) internal successors, (350), 199 states have internal predecessors, (350), 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:36:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:43,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:43,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:43,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -546363939, now seen corresponding path program 1 times [2025-03-16 19:36:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044217758] [2025-03-16 19:36:43,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:43,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:43,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:43,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:43,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:36:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044217758] [2025-03-16 19:36:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044217758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018834180] [2025-03-16 19:36:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:43,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:43,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:43,864 INFO L87 Difference]: Start difference. First operand has 200 states, 198 states have (on average 1.7676767676767677) internal successors, (350), 199 states have internal predecessors, (350), 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 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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:36:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:44,524 INFO L93 Difference]: Finished difference Result 1439 states and 2327 transitions. [2025-03-16 19:36:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:36:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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 106 [2025-03-16 19:36:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:44,537 INFO L225 Difference]: With dead ends: 1439 [2025-03-16 19:36:44,537 INFO L226 Difference]: Without dead ends: 1331 [2025-03-16 19:36:44,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:36:44,544 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 2429 mSDsluCounter, 6748 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 7817 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:44,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 7817 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:36:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-03-16 19:36:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 302. [2025-03-16 19:36:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.451827242524917) internal successors, (437), 301 states have internal predecessors, (437), 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:36:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2025-03-16 19:36:44,601 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 106 [2025-03-16 19:36:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:44,602 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2025-03-16 19:36:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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:36:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2025-03-16 19:36:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:44,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:44,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:36:44,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:44,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1378292481, now seen corresponding path program 1 times [2025-03-16 19:36:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064390171] [2025-03-16 19:36:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:44,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:44,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:44,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:44,886 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:36:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064390171] [2025-03-16 19:36:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064390171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271197854] [2025-03-16 19:36:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:44,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:44,889 INFO L87 Difference]: Start difference. First operand 302 states and 437 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:45,185 INFO L93 Difference]: Finished difference Result 1558 states and 2434 transitions. [2025-03-16 19:36:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:45,190 INFO L225 Difference]: With dead ends: 1558 [2025-03-16 19:36:45,193 INFO L226 Difference]: Without dead ends: 1398 [2025-03-16 19:36:45,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:45,197 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 1718 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:45,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 4223 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-16 19:36:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 481. [2025-03-16 19:36:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.50625) internal successors, (723), 480 states have internal predecessors, (723), 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:36:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 723 transitions. [2025-03-16 19:36:45,229 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 723 transitions. Word has length 108 [2025-03-16 19:36:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:45,229 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 723 transitions. [2025-03-16 19:36:45,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 723 transitions. [2025-03-16 19:36:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:45,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:45,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:45,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:36:45,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:45,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:45,232 INFO L85 PathProgramCache]: Analyzing trace with hash 399429369, now seen corresponding path program 1 times [2025-03-16 19:36:45,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:45,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397714754] [2025-03-16 19:36:45,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:45,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:45,471 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:36:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397714754] [2025-03-16 19:36:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397714754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:45,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027536626] [2025-03-16 19:36:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:45,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:45,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:45,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:45,474 INFO L87 Difference]: Start difference. First operand 481 states and 723 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:45,752 INFO L93 Difference]: Finished difference Result 1737 states and 2720 transitions. [2025-03-16 19:36:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:45,758 INFO L225 Difference]: With dead ends: 1737 [2025-03-16 19:36:45,758 INFO L226 Difference]: Without dead ends: 1577 [2025-03-16 19:36:45,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:45,760 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 1711 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:45,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 3666 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-16 19:36:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 739. [2025-03-16 19:36:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.537940379403794) internal successors, (1135), 738 states have internal predecessors, (1135), 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:36:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1135 transitions. [2025-03-16 19:36:45,783 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1135 transitions. Word has length 108 [2025-03-16 19:36:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1135 transitions. [2025-03-16 19:36:45,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1135 transitions. [2025-03-16 19:36:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:45,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:45,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:36:45,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -448178687, now seen corresponding path program 1 times [2025-03-16 19:36:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134114866] [2025-03-16 19:36:45,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:45,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:45,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:45,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:46,040 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:36:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134114866] [2025-03-16 19:36:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134114866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:46,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433914279] [2025-03-16 19:36:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:46,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:46,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:46,043 INFO L87 Difference]: Start difference. First operand 739 states and 1135 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:46,302 INFO L93 Difference]: Finished difference Result 1911 states and 2998 transitions. [2025-03-16 19:36:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:46,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:46,309 INFO L225 Difference]: With dead ends: 1911 [2025-03-16 19:36:46,309 INFO L226 Difference]: Without dead ends: 1751 [2025-03-16 19:36:46,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:46,313 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1817 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:46,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 3301 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-16 19:36:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 913. [2025-03-16 19:36:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.549342105263158) internal successors, (1413), 912 states have internal predecessors, (1413), 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:36:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1413 transitions. [2025-03-16 19:36:46,336 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1413 transitions. Word has length 108 [2025-03-16 19:36:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:46,336 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1413 transitions. [2025-03-16 19:36:46,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1413 transitions. [2025-03-16 19:36:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:46,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:46,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:46,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:36:46,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 42691577, now seen corresponding path program 1 times [2025-03-16 19:36:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83719328] [2025-03-16 19:36:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:46,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:46,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:46,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83719328] [2025-03-16 19:36:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83719328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758093368] [2025-03-16 19:36:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:46,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:46,520 INFO L87 Difference]: Start difference. First operand 913 states and 1413 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:46,751 INFO L93 Difference]: Finished difference Result 2080 states and 3268 transitions. [2025-03-16 19:36:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:46,757 INFO L225 Difference]: With dead ends: 2080 [2025-03-16 19:36:46,757 INFO L226 Difference]: Without dead ends: 1920 [2025-03-16 19:36:46,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:46,758 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1922 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:46,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 3125 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-03-16 19:36:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1082. [2025-03-16 19:36:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.5568917668825162) internal successors, (1683), 1081 states have internal predecessors, (1683), 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:36:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1683 transitions. [2025-03-16 19:36:46,781 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1683 transitions. Word has length 108 [2025-03-16 19:36:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:46,781 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1683 transitions. [2025-03-16 19:36:46,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1683 transitions. [2025-03-16 19:36:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:46,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:46,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:46,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:36:46,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 68802817, now seen corresponding path program 1 times [2025-03-16 19:36:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:46,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110602892] [2025-03-16 19:36:46,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:46,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:46,957 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:36:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110602892] [2025-03-16 19:36:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110602892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:46,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453332285] [2025-03-16 19:36:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:46,959 INFO L87 Difference]: Start difference. First operand 1082 states and 1683 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:47,175 INFO L93 Difference]: Finished difference Result 2244 states and 3530 transitions. [2025-03-16 19:36:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:47,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:47,181 INFO L225 Difference]: With dead ends: 2244 [2025-03-16 19:36:47,181 INFO L226 Difference]: Without dead ends: 2084 [2025-03-16 19:36:47,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:47,183 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2026 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:47,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 3135 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2025-03-16 19:36:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1246. [2025-03-16 19:36:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 1.5622489959839359) internal successors, (1945), 1245 states have internal predecessors, (1945), 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:36:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1945 transitions. [2025-03-16 19:36:47,208 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1945 transitions. Word has length 108 [2025-03-16 19:36:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:47,208 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 1945 transitions. [2025-03-16 19:36:47,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1945 transitions. [2025-03-16 19:36:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:47,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:47,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:36:47,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1782696185, now seen corresponding path program 1 times [2025-03-16 19:36:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425169210] [2025-03-16 19:36:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:47,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:47,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:47,370 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:36:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425169210] [2025-03-16 19:36:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425169210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:47,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801629072] [2025-03-16 19:36:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:47,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:47,371 INFO L87 Difference]: Start difference. First operand 1246 states and 1945 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:47,606 INFO L93 Difference]: Finished difference Result 2403 states and 3784 transitions. [2025-03-16 19:36:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:47,613 INFO L225 Difference]: With dead ends: 2403 [2025-03-16 19:36:47,614 INFO L226 Difference]: Without dead ends: 2243 [2025-03-16 19:36:47,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:47,616 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2127 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:47,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 3444 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-16 19:36:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1405. [2025-03-16 19:36:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.5662393162393162) internal successors, (2199), 1404 states have internal predecessors, (2199), 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:36:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2199 transitions. [2025-03-16 19:36:47,647 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2199 transitions. Word has length 108 [2025-03-16 19:36:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:47,647 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2199 transitions. [2025-03-16 19:36:47,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2199 transitions. [2025-03-16 19:36:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:47,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:47,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:36:47,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1990540441, now seen corresponding path program 1 times [2025-03-16 19:36:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:47,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682303476] [2025-03-16 19:36:47,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:47,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:47,814 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:36:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682303476] [2025-03-16 19:36:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682303476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:47,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681803202] [2025-03-16 19:36:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:47,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:47,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:47,816 INFO L87 Difference]: Start difference. First operand 1405 states and 2199 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:48,023 INFO L93 Difference]: Finished difference Result 2561 states and 4037 transitions. [2025-03-16 19:36:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:48,030 INFO L225 Difference]: With dead ends: 2561 [2025-03-16 19:36:48,031 INFO L226 Difference]: Without dead ends: 2401 [2025-03-16 19:36:48,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:48,033 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 2224 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:48,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 3706 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-03-16 19:36:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1563. [2025-03-16 19:36:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 1.5697823303457106) internal successors, (2452), 1562 states have internal predecessors, (2452), 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:36:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2452 transitions. [2025-03-16 19:36:48,067 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2452 transitions. Word has length 108 [2025-03-16 19:36:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:48,067 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2452 transitions. [2025-03-16 19:36:48,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2452 transitions. [2025-03-16 19:36:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:48,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:48,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:36:48,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1030704730, now seen corresponding path program 1 times [2025-03-16 19:36:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253641390] [2025-03-16 19:36:48,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:48,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:48,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:48,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:48,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:48,152 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:36:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253641390] [2025-03-16 19:36:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253641390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501781753] [2025-03-16 19:36:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:48,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:48,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:48,154 INFO L87 Difference]: Start difference. First operand 1563 states and 2452 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:36:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:48,191 INFO L93 Difference]: Finished difference Result 4143 states and 6562 transitions. [2025-03-16 19:36:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:48,199 INFO L225 Difference]: With dead ends: 4143 [2025-03-16 19:36:48,199 INFO L226 Difference]: Without dead ends: 2798 [2025-03-16 19:36:48,201 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:36:48,201 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:48,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 636 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-16 19:36:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2762. [2025-03-16 19:36:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2761 states have (on average 1.5660992394060123) internal successors, (4324), 2761 states have internal predecessors, (4324), 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:36:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4324 transitions. [2025-03-16 19:36:48,250 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4324 transitions. Word has length 108 [2025-03-16 19:36:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4324 transitions. [2025-03-16 19:36:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:36:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4324 transitions. [2025-03-16 19:36:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:36:48,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:48,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:36:48,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1029542881, now seen corresponding path program 1 times [2025-03-16 19:36:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690819003] [2025-03-16 19:36:48,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:48,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:36:48,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:36:48,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:48,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:48,588 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:36:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690819003] [2025-03-16 19:36:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690819003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599484681] [2025-03-16 19:36:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:48,590 INFO L87 Difference]: Start difference. First operand 2762 states and 4324 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:48,900 INFO L93 Difference]: Finished difference Result 5308 states and 8349 transitions. [2025-03-16 19:36:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 108 [2025-03-16 19:36:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:48,908 INFO L225 Difference]: With dead ends: 5308 [2025-03-16 19:36:48,908 INFO L226 Difference]: Without dead ends: 2764 [2025-03-16 19:36:48,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:48,912 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 960 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:48,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 1228 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-16 19:36:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2762. [2025-03-16 19:36:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2761 states have (on average 1.5628395508873596) internal successors, (4315), 2761 states have internal predecessors, (4315), 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:36:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4315 transitions. [2025-03-16 19:36:48,954 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4315 transitions. Word has length 108 [2025-03-16 19:36:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4315 transitions. [2025-03-16 19:36:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:36:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4315 transitions. [2025-03-16 19:36:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:48,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:48,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:48,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:36:48,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1882302346, now seen corresponding path program 1 times [2025-03-16 19:36:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441198648] [2025-03-16 19:36:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:48,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:48,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:48,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:48,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:49,046 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:36:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441198648] [2025-03-16 19:36:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441198648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234178935] [2025-03-16 19:36:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:49,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:49,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:49,047 INFO L87 Difference]: Start difference. First operand 2762 states and 4315 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:36:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:49,249 INFO L93 Difference]: Finished difference Result 8110 states and 12740 transitions. [2025-03-16 19:36:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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 109 [2025-03-16 19:36:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:49,265 INFO L225 Difference]: With dead ends: 8110 [2025-03-16 19:36:49,266 INFO L226 Difference]: Without dead ends: 5403 [2025-03-16 19:36:49,270 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:36:49,270 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1081 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:49,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 238 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2025-03-16 19:36:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5401. [2025-03-16 19:36:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.5638888888888889) internal successors, (8445), 5400 states have internal predecessors, (8445), 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:36:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8445 transitions. [2025-03-16 19:36:49,342 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8445 transitions. Word has length 109 [2025-03-16 19:36:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:49,342 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8445 transitions. [2025-03-16 19:36:49,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:36:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8445 transitions. [2025-03-16 19:36:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:36:49,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:49,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:36:49,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1592750041, now seen corresponding path program 1 times [2025-03-16 19:36:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865477102] [2025-03-16 19:36:49,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:36:49,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:36:49,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:49,461 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:36:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865477102] [2025-03-16 19:36:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865477102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536021585] [2025-03-16 19:36:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:49,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:49,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:49,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:49,463 INFO L87 Difference]: Start difference. First operand 5401 states and 8445 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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:36:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:49,610 INFO L93 Difference]: Finished difference Result 10735 states and 16820 transitions. [2025-03-16 19:36:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2025-03-16 19:36:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:49,620 INFO L225 Difference]: With dead ends: 10735 [2025-03-16 19:36:49,620 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:49,627 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:36:49,627 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 706 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:49,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 173 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.551111111111111) internal successors, (8376), 5400 states have internal predecessors, (8376), 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:36:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8376 transitions. [2025-03-16 19:36:49,725 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8376 transitions. Word has length 110 [2025-03-16 19:36:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8376 transitions. [2025-03-16 19:36:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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:36:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8376 transitions. [2025-03-16 19:36:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:49,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:49,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:49,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:36:49,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:49,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash 116815730, now seen corresponding path program 1 times [2025-03-16 19:36:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604001421] [2025-03-16 19:36:49,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:49,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:49,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:49,833 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:36:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604001421] [2025-03-16 19:36:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604001421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:49,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:49,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353371028] [2025-03-16 19:36:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:49,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:49,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:49,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:49,835 INFO L87 Difference]: Start difference. First operand 5401 states and 8376 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:36:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:49,967 INFO L93 Difference]: Finished difference Result 10723 states and 16668 transitions. [2025-03-16 19:36:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:49,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2025-03-16 19:36:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:49,976 INFO L225 Difference]: With dead ends: 10723 [2025-03-16 19:36:49,977 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:49,982 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:36:49,982 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 667 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:49,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 201 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.5383333333333333) internal successors, (8307), 5400 states have internal predecessors, (8307), 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:36:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8307 transitions. [2025-03-16 19:36:50,053 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8307 transitions. Word has length 111 [2025-03-16 19:36:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8307 transitions. [2025-03-16 19:36:50,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:36:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8307 transitions. [2025-03-16 19:36:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:36:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:50,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:36:50,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 935176491, now seen corresponding path program 1 times [2025-03-16 19:36:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142094130] [2025-03-16 19:36:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:36:50,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:36:50,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:50,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,159 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:36:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142094130] [2025-03-16 19:36:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142094130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532630526] [2025-03-16 19:36:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:50,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:50,161 INFO L87 Difference]: Start difference. First operand 5401 states and 8307 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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:36:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:50,285 INFO L93 Difference]: Finished difference Result 10731 states and 16540 transitions. [2025-03-16 19:36:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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:36:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:50,294 INFO L225 Difference]: With dead ends: 10731 [2025-03-16 19:36:50,295 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:50,301 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:36:50,301 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 682 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:50,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 181 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.5255555555555556) internal successors, (8238), 5400 states have internal predecessors, (8238), 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:36:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8238 transitions. [2025-03-16 19:36:50,369 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8238 transitions. Word has length 112 [2025-03-16 19:36:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:50,370 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8238 transitions. [2025-03-16 19:36:50,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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:36:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8238 transitions. [2025-03-16 19:36:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:36:50,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:50,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:50,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:36:50,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1173603310, now seen corresponding path program 1 times [2025-03-16 19:36:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83273927] [2025-03-16 19:36:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:36:50,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:36:50,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:50,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,451 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:36:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83273927] [2025-03-16 19:36:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83273927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061497157] [2025-03-16 19:36:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:50,453 INFO L87 Difference]: Start difference. First operand 5401 states and 8238 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:36:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:50,581 INFO L93 Difference]: Finished difference Result 10743 states and 16416 transitions. [2025-03-16 19:36:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:36:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:50,590 INFO L225 Difference]: With dead ends: 10743 [2025-03-16 19:36:50,590 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:50,596 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:36:50,597 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 710 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:50,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 157 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.5127777777777778) internal successors, (8169), 5400 states have internal predecessors, (8169), 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:36:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8169 transitions. [2025-03-16 19:36:50,670 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8169 transitions. Word has length 113 [2025-03-16 19:36:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8169 transitions. [2025-03-16 19:36:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:36:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8169 transitions. [2025-03-16 19:36:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:36:50,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:50,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:50,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:36:50,672 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash -360444057, now seen corresponding path program 1 times [2025-03-16 19:36:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115629891] [2025-03-16 19:36:50,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:36:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:36:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,772 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:36:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115629891] [2025-03-16 19:36:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115629891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086406226] [2025-03-16 19:36:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:50,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:50,774 INFO L87 Difference]: Start difference. First operand 5401 states and 8169 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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:36:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:50,900 INFO L93 Difference]: Finished difference Result 10739 states and 16274 transitions. [2025-03-16 19:36:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2025-03-16 19:36:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:50,908 INFO L225 Difference]: With dead ends: 10739 [2025-03-16 19:36:50,908 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:50,913 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:36:50,914 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 692 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:50,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 165 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.5) internal successors, (8100), 5400 states have internal predecessors, (8100), 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:36:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8100 transitions. [2025-03-16 19:36:50,979 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8100 transitions. Word has length 114 [2025-03-16 19:36:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:50,979 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8100 transitions. [2025-03-16 19:36:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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:36:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8100 transitions. [2025-03-16 19:36:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:36:50,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:50,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:50,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:36:50,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -428745458, now seen corresponding path program 1 times [2025-03-16 19:36:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731159180] [2025-03-16 19:36:50,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:36:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:36:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:51,068 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:36:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731159180] [2025-03-16 19:36:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731159180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:51,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440620934] [2025-03-16 19:36:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:51,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:51,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:51,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:51,070 INFO L87 Difference]: Start difference. First operand 5401 states and 8100 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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:36:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:51,192 INFO L93 Difference]: Finished difference Result 10727 states and 16124 transitions. [2025-03-16 19:36:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-03-16 19:36:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:51,200 INFO L225 Difference]: With dead ends: 10727 [2025-03-16 19:36:51,200 INFO L226 Difference]: Without dead ends: 5401 [2025-03-16 19:36:51,205 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:36:51,205 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 650 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:51,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 189 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2025-03-16 19:36:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2025-03-16 19:36:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.4872222222222222) internal successors, (8031), 5400 states have internal predecessors, (8031), 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:36:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8031 transitions. [2025-03-16 19:36:51,267 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8031 transitions. Word has length 115 [2025-03-16 19:36:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8031 transitions. [2025-03-16 19:36:51,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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:36:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8031 transitions. [2025-03-16 19:36:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:36:51,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:51,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:51,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:36:51,269 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 534097843, now seen corresponding path program 1 times [2025-03-16 19:36:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931842997] [2025-03-16 19:36:51,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:51,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:36:51,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:36:51,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:51,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:51,695 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:36:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931842997] [2025-03-16 19:36:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931842997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:36:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579961138] [2025-03-16 19:36:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:36:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:51,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:36:51,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:51,697 INFO L87 Difference]: Start difference. First operand 5401 states and 8031 transitions. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 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:36:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:52,281 INFO L93 Difference]: Finished difference Result 16010 states and 23807 transitions. [2025-03-16 19:36:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:36:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 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 116 [2025-03-16 19:36:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:52,297 INFO L225 Difference]: With dead ends: 16010 [2025-03-16 19:36:52,297 INFO L226 Difference]: Without dead ends: 10781 [2025-03-16 19:36:52,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:36:52,305 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 784 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:52,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 865 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10781 states. [2025-03-16 19:36:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10781 to 5401. [2025-03-16 19:36:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.4861111111111112) internal successors, (8025), 5400 states have internal predecessors, (8025), 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:36:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8025 transitions. [2025-03-16 19:36:52,436 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8025 transitions. Word has length 116 [2025-03-16 19:36:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:52,436 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8025 transitions. [2025-03-16 19:36:52,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 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:36:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8025 transitions. [2025-03-16 19:36:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:36:52,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:52,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:52,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:36:52,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:52,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash -90301816, now seen corresponding path program 1 times [2025-03-16 19:36:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4087756] [2025-03-16 19:36:52,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:52,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:36:52,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:36:52,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:52,880 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:36:52,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:52,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4087756] [2025-03-16 19:36:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4087756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:52,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:52,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:36:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076433594] [2025-03-16 19:36:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:36:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:52,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:36:52,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:52,881 INFO L87 Difference]: Start difference. First operand 5401 states and 8025 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 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:36:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:53,456 INFO L93 Difference]: Finished difference Result 16172 states and 23924 transitions. [2025-03-16 19:36:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:36:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 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 117 [2025-03-16 19:36:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:53,498 INFO L225 Difference]: With dead ends: 16172 [2025-03-16 19:36:53,499 INFO L226 Difference]: Without dead ends: 11030 [2025-03-16 19:36:53,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:36:53,502 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1475 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:53,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 851 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11030 states. [2025-03-16 19:36:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11030 to 5473. [2025-03-16 19:36:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5473 states, 5472 states have (on average 1.4841008771929824) internal successors, (8121), 5472 states have internal predecessors, (8121), 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:36:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 8121 transitions. [2025-03-16 19:36:53,569 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 8121 transitions. Word has length 117 [2025-03-16 19:36:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:53,569 INFO L471 AbstractCegarLoop]: Abstraction has 5473 states and 8121 transitions. [2025-03-16 19:36:53,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 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:36:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 8121 transitions. [2025-03-16 19:36:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:36:53,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:53,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:53,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:36:53,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -179914624, now seen corresponding path program 1 times [2025-03-16 19:36:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130519042] [2025-03-16 19:36:53,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:36:53,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:36:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:53,903 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:36:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130519042] [2025-03-16 19:36:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130519042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:53,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:36:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443485701] [2025-03-16 19:36:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:36:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:53,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:36:53,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:53,905 INFO L87 Difference]: Start difference. First operand 5473 states and 8121 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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:36:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:54,459 INFO L93 Difference]: Finished difference Result 15980 states and 23723 transitions. [2025-03-16 19:36:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:36:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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 117 [2025-03-16 19:36:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:54,477 INFO L225 Difference]: With dead ends: 15980 [2025-03-16 19:36:54,477 INFO L226 Difference]: Without dead ends: 10826 [2025-03-16 19:36:54,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:36:54,483 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 815 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:54,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 769 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10826 states. [2025-03-16 19:36:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10826 to 5401. [2025-03-16 19:36:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.484074074074074) internal successors, (8014), 5400 states have internal predecessors, (8014), 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:36:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8014 transitions. [2025-03-16 19:36:54,562 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8014 transitions. Word has length 117 [2025-03-16 19:36:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:54,562 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8014 transitions. [2025-03-16 19:36:54,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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:36:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8014 transitions. [2025-03-16 19:36:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:36:54,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:54,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:54,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:36:54,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1829511304, now seen corresponding path program 1 times [2025-03-16 19:36:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288320091] [2025-03-16 19:36:54,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:36:54,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:36:54,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:54,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:54,884 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:36:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288320091] [2025-03-16 19:36:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288320091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:36:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314012882] [2025-03-16 19:36:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:36:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:54,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:36:54,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:54,886 INFO L87 Difference]: Start difference. First operand 5401 states and 8014 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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:36:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:55,424 INFO L93 Difference]: Finished difference Result 13422 states and 19891 transitions. [2025-03-16 19:36:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:36:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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 117 [2025-03-16 19:36:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:55,434 INFO L225 Difference]: With dead ends: 13422 [2025-03-16 19:36:55,435 INFO L226 Difference]: Without dead ends: 8178 [2025-03-16 19:36:55,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:36:55,440 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1242 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:55,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 778 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2025-03-16 19:36:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 5401. [2025-03-16 19:36:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.4835185185185185) internal successors, (8011), 5400 states have internal predecessors, (8011), 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:36:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8011 transitions. [2025-03-16 19:36:55,501 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8011 transitions. Word has length 117 [2025-03-16 19:36:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:55,501 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8011 transitions. [2025-03-16 19:36:55,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 11 states have internal predecessors, (117), 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:36:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8011 transitions. [2025-03-16 19:36:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:36:55,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:55,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:36:55,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:55,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1723350189, now seen corresponding path program 1 times [2025-03-16 19:36:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375507703] [2025-03-16 19:36:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:55,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:36:55,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:36:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:55,681 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:36:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375507703] [2025-03-16 19:36:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375507703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832501530] [2025-03-16 19:36:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:55,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:55,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:55,683 INFO L87 Difference]: Start difference. First operand 5401 states and 8011 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 7 states have internal predecessors, (118), 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:36:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:55,991 INFO L93 Difference]: Finished difference Result 15670 states and 23328 transitions. [2025-03-16 19:36:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 7 states have internal predecessors, (118), 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 118 [2025-03-16 19:36:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:56,005 INFO L225 Difference]: With dead ends: 15670 [2025-03-16 19:36:56,006 INFO L226 Difference]: Without dead ends: 10487 [2025-03-16 19:36:56,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:56,012 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 922 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:56,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 644 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2025-03-16 19:36:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 5401. [2025-03-16 19:36:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5400 states have (on average 1.4833333333333334) internal successors, (8010), 5400 states have internal predecessors, (8010), 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:36:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 8010 transitions. [2025-03-16 19:36:56,099 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 8010 transitions. Word has length 118 [2025-03-16 19:36:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:56,099 INFO L471 AbstractCegarLoop]: Abstraction has 5401 states and 8010 transitions. [2025-03-16 19:36:56,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 7 states have internal predecessors, (118), 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:36:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 8010 transitions. [2025-03-16 19:36:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:36:56,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:56,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:56,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:36:56,101 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 421544224, now seen corresponding path program 1 times [2025-03-16 19:36:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926289327] [2025-03-16 19:36:56,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:56,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:36:56,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:36:56,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:56,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:56,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:36:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926289327] [2025-03-16 19:36:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926289327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:36:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316929314] [2025-03-16 19:36:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:56,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:56,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:56,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:56,347 INFO L87 Difference]: Start difference. First operand 5401 states and 8010 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 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:36:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:56,757 INFO L93 Difference]: Finished difference Result 15946 states and 23641 transitions. [2025-03-16 19:36:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:36:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 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 119 [2025-03-16 19:36:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:56,772 INFO L225 Difference]: With dead ends: 15946 [2025-03-16 19:36:56,773 INFO L226 Difference]: Without dead ends: 10860 [2025-03-16 19:36:56,778 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:36:56,779 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 698 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:56,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 690 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:36:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2025-03-16 19:36:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 5446. [2025-03-16 19:36:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 5445 states have (on average 1.4820936639118458) internal successors, (8070), 5445 states have internal predecessors, (8070), 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:36:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 8070 transitions. [2025-03-16 19:36:56,852 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 8070 transitions. Word has length 119 [2025-03-16 19:36:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:56,852 INFO L471 AbstractCegarLoop]: Abstraction has 5446 states and 8070 transitions. [2025-03-16 19:36:56,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 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:36:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 8070 transitions. [2025-03-16 19:36:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:36:56,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:56,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:36:56,854 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:56,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1968192658, now seen corresponding path program 1 times [2025-03-16 19:36:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751396053] [2025-03-16 19:36:56,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:56,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:36:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:36:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:56,925 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:36:56,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:56,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751396053] [2025-03-16 19:36:56,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751396053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282765694] [2025-03-16 19:36:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:56,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:56,927 INFO L87 Difference]: Start difference. First operand 5446 states and 8070 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:36:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:56,958 INFO L93 Difference]: Finished difference Result 15346 states and 22904 transitions. [2025-03-16 19:36:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:56,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2025-03-16 19:36:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:56,972 INFO L225 Difference]: With dead ends: 15346 [2025-03-16 19:36:56,972 INFO L226 Difference]: Without dead ends: 10260 [2025-03-16 19:36:56,978 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:36:56,979 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 135 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:56,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 556 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2025-03-16 19:36:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9986. [2025-03-16 19:36:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.4779168753129694) internal successors, (14757), 9985 states have internal predecessors, (14757), 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:36:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 14757 transitions. [2025-03-16 19:36:57,092 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 14757 transitions. Word has length 120 [2025-03-16 19:36:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:57,092 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 14757 transitions. [2025-03-16 19:36:57,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:36:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 14757 transitions. [2025-03-16 19:36:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:36:57,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:57,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:57,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:36:57,093 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:57,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash -640514158, now seen corresponding path program 1 times [2025-03-16 19:36:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495203609] [2025-03-16 19:36:57,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:57,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:36:57,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:36:57,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:57,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:57,335 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:36:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495203609] [2025-03-16 19:36:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495203609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:36:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050355786] [2025-03-16 19:36:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:57,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:57,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:57,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:57,337 INFO L87 Difference]: Start difference. First operand 9986 states and 14757 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 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:36:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:57,854 INFO L93 Difference]: Finished difference Result 29844 states and 44061 transitions. [2025-03-16 19:36:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:36:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 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 120 [2025-03-16 19:36:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:57,880 INFO L225 Difference]: With dead ends: 29844 [2025-03-16 19:36:57,880 INFO L226 Difference]: Without dead ends: 20066 [2025-03-16 19:36:57,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:36:57,891 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 991 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:57,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 803 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:36:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20066 states. [2025-03-16 19:36:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20066 to 9986. [2025-03-16 19:36:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.4770155232849274) internal successors, (14748), 9985 states have internal predecessors, (14748), 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:36:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 14748 transitions. [2025-03-16 19:36:58,097 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 14748 transitions. Word has length 120 [2025-03-16 19:36:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:58,097 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 14748 transitions. [2025-03-16 19:36:58,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 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:36:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 14748 transitions. [2025-03-16 19:36:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:36:58,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:58,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:36:58,099 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2030476573, now seen corresponding path program 1 times [2025-03-16 19:36:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897143579] [2025-03-16 19:36:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:36:58,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:36:58,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:58,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:58,299 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:36:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897143579] [2025-03-16 19:36:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897143579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:36:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57547437] [2025-03-16 19:36:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:36:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:58,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:36:58,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:36:58,301 INFO L87 Difference]: Start difference. First operand 9986 states and 14748 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 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:36:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:58,847 INFO L93 Difference]: Finished difference Result 29669 states and 43790 transitions. [2025-03-16 19:36:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:36:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 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 121 [2025-03-16 19:36:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:58,869 INFO L225 Difference]: With dead ends: 29669 [2025-03-16 19:36:58,869 INFO L226 Difference]: Without dead ends: 19991 [2025-03-16 19:36:58,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:36:58,880 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 526 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:58,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1033 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19991 states. [2025-03-16 19:36:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19991 to 9986. [2025-03-16 19:36:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.4757135703555333) internal successors, (14735), 9985 states have internal predecessors, (14735), 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:36:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 14735 transitions. [2025-03-16 19:36:59,079 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 14735 transitions. Word has length 121 [2025-03-16 19:36:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:59,079 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 14735 transitions. [2025-03-16 19:36:59,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 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:36:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 14735 transitions. [2025-03-16 19:36:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:36:59,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:59,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:36:59,082 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -3240126, now seen corresponding path program 1 times [2025-03-16 19:36:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295289116] [2025-03-16 19:36:59,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:59,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:36:59,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:36:59,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:59,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:59,576 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:36:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295289116] [2025-03-16 19:36:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295289116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:59,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:36:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299309466] [2025-03-16 19:36:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:59,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:36:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:59,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:36:59,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:59,578 INFO L87 Difference]: Start difference. First operand 9986 states and 14735 transitions. Second operand has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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:37:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:00,104 INFO L93 Difference]: Finished difference Result 22060 states and 32627 transitions. [2025-03-16 19:37:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:37:00,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:00,124 INFO L225 Difference]: With dead ends: 22060 [2025-03-16 19:37:00,124 INFO L226 Difference]: Without dead ends: 19718 [2025-03-16 19:37:00,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:37:00,132 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1140 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:00,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1909 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19718 states. [2025-03-16 19:37:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19718 to 9943. [2025-03-16 19:37:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9943 states, 9942 states have (on average 1.475759404546369) internal successors, (14672), 9942 states have internal predecessors, (14672), 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:37:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 14672 transitions. [2025-03-16 19:37:00,348 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 14672 transitions. Word has length 122 [2025-03-16 19:37:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:00,349 INFO L471 AbstractCegarLoop]: Abstraction has 9943 states and 14672 transitions. [2025-03-16 19:37:00,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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:37:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 14672 transitions. [2025-03-16 19:37:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:00,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:37:00,351 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -605229387, now seen corresponding path program 1 times [2025-03-16 19:37:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451808333] [2025-03-16 19:37:00,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:00,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:00,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:00,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:00,941 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:37:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451808333] [2025-03-16 19:37:00,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451808333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:00,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:37:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317802798] [2025-03-16 19:37:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:37:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:00,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:37:00,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:37:00,943 INFO L87 Difference]: Start difference. First operand 9943 states and 14672 transitions. Second operand has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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:37:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:01,572 INFO L93 Difference]: Finished difference Result 24293 states and 35923 transitions. [2025-03-16 19:37:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:01,622 INFO L225 Difference]: With dead ends: 24293 [2025-03-16 19:37:01,622 INFO L226 Difference]: Without dead ends: 21941 [2025-03-16 19:37:01,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:37:01,625 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1154 mSDsluCounter, 4038 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 4681 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21941 states. [2025-03-16 19:37:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21941 to 9880. [2025-03-16 19:37:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9880 states, 9879 states have (on average 1.476566454094544) internal successors, (14587), 9879 states have internal predecessors, (14587), 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:37:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 14587 transitions. [2025-03-16 19:37:01,742 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 14587 transitions. Word has length 122 [2025-03-16 19:37:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:01,742 INFO L471 AbstractCegarLoop]: Abstraction has 9880 states and 14587 transitions. [2025-03-16 19:37:01,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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:37:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 14587 transitions. [2025-03-16 19:37:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:01,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:01,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:01,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:37:01,744 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:01,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1270127445, now seen corresponding path program 1 times [2025-03-16 19:37:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051077996] [2025-03-16 19:37:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:01,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:01,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:01,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:01,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:02,182 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:37:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051077996] [2025-03-16 19:37:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051077996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:37:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239051439] [2025-03-16 19:37:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:02,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:37:02,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:02,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:37:02,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:37:02,183 INFO L87 Difference]: Start difference. First operand 9880 states and 14587 transitions. Second operand has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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:37:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:02,757 INFO L93 Difference]: Finished difference Result 41100 states and 60939 transitions. [2025-03-16 19:37:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:02,798 INFO L225 Difference]: With dead ends: 41100 [2025-03-16 19:37:02,799 INFO L226 Difference]: Without dead ends: 38834 [2025-03-16 19:37:02,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:37:02,813 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1508 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:02,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2693 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38834 states. [2025-03-16 19:37:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38834 to 9902. [2025-03-16 19:37:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9902 states, 9901 states have (on average 1.4766185233814766) internal successors, (14620), 9901 states have internal predecessors, (14620), 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:37:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9902 states to 9902 states and 14620 transitions. [2025-03-16 19:37:03,047 INFO L78 Accepts]: Start accepts. Automaton has 9902 states and 14620 transitions. Word has length 122 [2025-03-16 19:37:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:03,047 INFO L471 AbstractCegarLoop]: Abstraction has 9902 states and 14620 transitions. [2025-03-16 19:37:03,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 13 states have internal predecessors, (122), 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:37:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9902 states and 14620 transitions. [2025-03-16 19:37:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:03,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:03,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:37:03,048 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1950858174, now seen corresponding path program 1 times [2025-03-16 19:37:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518080108] [2025-03-16 19:37:03,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:03,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:03,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:03,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:05,926 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:37:05,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:05,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518080108] [2025-03-16 19:37:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518080108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:05,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2025-03-16 19:37:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477000520] [2025-03-16 19:37:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:05,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-16 19:37:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:05,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-16 19:37:05,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1930, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 19:37:05,928 INFO L87 Difference]: Start difference. First operand 9902 states and 14620 transitions. Second operand has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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:37:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:16,300 INFO L93 Difference]: Finished difference Result 19161 states and 28291 transitions. [2025-03-16 19:37:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 19:37:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:16,319 INFO L225 Difference]: With dead ends: 19161 [2025-03-16 19:37:16,319 INFO L226 Difference]: Without dead ends: 18027 [2025-03-16 19:37:16,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=968, Invalid=6342, Unknown=0, NotChecked=0, Total=7310 [2025-03-16 19:37:16,324 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 2435 mSDsluCounter, 21793 mSDsCounter, 0 mSdLazyCounter, 15466 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 22672 SdHoareTripleChecker+Invalid, 15469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:16,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 22672 Invalid, 15469 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 15466 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-03-16 19:37:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2025-03-16 19:37:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 9936. [2025-03-16 19:37:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9936 states, 9935 states have (on average 1.4760946149974836) internal successors, (14665), 9935 states have internal predecessors, (14665), 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:37:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9936 states to 9936 states and 14665 transitions. [2025-03-16 19:37:16,441 INFO L78 Accepts]: Start accepts. Automaton has 9936 states and 14665 transitions. Word has length 122 [2025-03-16 19:37:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 9936 states and 14665 transitions. [2025-03-16 19:37:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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:37:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9936 states and 14665 transitions. [2025-03-16 19:37:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:16,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:16,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:37:16,442 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1942744858, now seen corresponding path program 1 times [2025-03-16 19:37:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044222710] [2025-03-16 19:37:16,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:16,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:16,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:16,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:19,383 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:37:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044222710] [2025-03-16 19:37:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044222710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2025-03-16 19:37:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673259471] [2025-03-16 19:37:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-16 19:37:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:19,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-16 19:37:19,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 19:37:19,386 INFO L87 Difference]: Start difference. First operand 9936 states and 14665 transitions. Second operand has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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:37:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:31,715 INFO L93 Difference]: Finished difference Result 19171 states and 28303 transitions. [2025-03-16 19:37:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 19:37:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:31,730 INFO L225 Difference]: With dead ends: 19171 [2025-03-16 19:37:31,730 INFO L226 Difference]: Without dead ends: 18037 [2025-03-16 19:37:31,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=870, Invalid=6440, Unknown=0, NotChecked=0, Total=7310 [2025-03-16 19:37:31,737 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 2826 mSDsluCounter, 24102 mSDsCounter, 0 mSdLazyCounter, 16982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2826 SdHoareTripleChecker+Valid, 24967 SdHoareTripleChecker+Invalid, 16982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:31,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2826 Valid, 24967 Invalid, 16982 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 16982 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-03-16 19:37:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18037 states. [2025-03-16 19:37:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18037 to 9941. [2025-03-16 19:37:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9941 states, 9940 states have (on average 1.476056338028169) internal successors, (14672), 9940 states have internal predecessors, (14672), 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:37:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14672 transitions. [2025-03-16 19:37:31,845 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14672 transitions. Word has length 122 [2025-03-16 19:37:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:31,845 INFO L471 AbstractCegarLoop]: Abstraction has 9941 states and 14672 transitions. [2025-03-16 19:37:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 45 states have internal predecessors, (122), 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:37:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14672 transitions. [2025-03-16 19:37:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:31,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:31,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:37:31,846 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1533092542, now seen corresponding path program 1 times [2025-03-16 19:37:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406377104] [2025-03-16 19:37:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:31,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:31,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:31,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:32,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:37:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:32,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406377104] [2025-03-16 19:37:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406377104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:32,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:37:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444938355] [2025-03-16 19:37:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:37:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:32,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:37:32,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:37:32,234 INFO L87 Difference]: Start difference. First operand 9941 states and 14672 transitions. Second operand has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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:37:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:32,698 INFO L93 Difference]: Finished difference Result 21969 states and 32503 transitions. [2025-03-16 19:37:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:37:32,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:32,713 INFO L225 Difference]: With dead ends: 21969 [2025-03-16 19:37:32,713 INFO L226 Difference]: Without dead ends: 19624 [2025-03-16 19:37:32,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:37:32,722 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 906 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:32,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2101 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19624 states. [2025-03-16 19:37:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19624 to 9883. [2025-03-16 19:37:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9883 states, 9882 states have (on average 1.476421776968225) internal successors, (14590), 9882 states have internal predecessors, (14590), 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:37:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 14590 transitions. [2025-03-16 19:37:32,849 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 14590 transitions. Word has length 122 [2025-03-16 19:37:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:32,850 INFO L471 AbstractCegarLoop]: Abstraction has 9883 states and 14590 transitions. [2025-03-16 19:37:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 12 states have internal predecessors, (122), 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:37:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 14590 transitions. [2025-03-16 19:37:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:37:32,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:32,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:37:32,850 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -690493534, now seen corresponding path program 1 times [2025-03-16 19:37:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015275496] [2025-03-16 19:37:32,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:37:32,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:37:32,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:32,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:33,406 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:37:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015275496] [2025-03-16 19:37:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015275496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:37:33,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328872393] [2025-03-16 19:37:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:37:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:37:33,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:33,407 INFO L87 Difference]: Start difference. First operand 9883 states and 14590 transitions. Second operand has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 16 states have internal predecessors, (122), 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:37:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:34,276 INFO L93 Difference]: Finished difference Result 14460 states and 21367 transitions. [2025-03-16 19:37:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:34,277 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 16 states have internal predecessors, (122), 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 122 [2025-03-16 19:37:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:34,285 INFO L225 Difference]: With dead ends: 14460 [2025-03-16 19:37:34,285 INFO L226 Difference]: Without dead ends: 12157 [2025-03-16 19:37:34,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:37:34,289 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1335 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:34,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 3815 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:37:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12157 states. [2025-03-16 19:37:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12157 to 9883. [2025-03-16 19:37:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9883 states, 9882 states have (on average 1.47632058287796) internal successors, (14589), 9882 states have internal predecessors, (14589), 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:37:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 14589 transitions. [2025-03-16 19:37:34,377 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 14589 transitions. Word has length 122 [2025-03-16 19:37:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:34,377 INFO L471 AbstractCegarLoop]: Abstraction has 9883 states and 14589 transitions. [2025-03-16 19:37:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 16 states have internal predecessors, (122), 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:37:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 14589 transitions. [2025-03-16 19:37:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:34,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:34,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:34,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:37:34,378 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:34,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 61702415, now seen corresponding path program 1 times [2025-03-16 19:37:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632761027] [2025-03-16 19:37:34,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:34,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:34,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:34,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:34,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:34,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632761027] [2025-03-16 19:37:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632761027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:34,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:37:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653721040] [2025-03-16 19:37:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:37:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:34,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:37:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:37:34,869 INFO L87 Difference]: Start difference. First operand 9883 states and 14589 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 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:37:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:35,652 INFO L93 Difference]: Finished difference Result 41201 states and 61042 transitions. [2025-03-16 19:37:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 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 123 [2025-03-16 19:37:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:35,681 INFO L225 Difference]: With dead ends: 41201 [2025-03-16 19:37:35,682 INFO L226 Difference]: Without dead ends: 38886 [2025-03-16 19:37:35,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:37:35,688 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 880 mSDsluCounter, 4570 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 5150 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:35,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 5150 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:37:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38886 states. [2025-03-16 19:37:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38886 to 9827. [2025-03-16 19:37:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 9826 states have (on average 1.477203338082638) internal successors, (14515), 9826 states have internal predecessors, (14515), 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:37:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 14515 transitions. [2025-03-16 19:37:35,899 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 14515 transitions. Word has length 123 [2025-03-16 19:37:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:35,899 INFO L471 AbstractCegarLoop]: Abstraction has 9827 states and 14515 transitions. [2025-03-16 19:37:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 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:37:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 14515 transitions. [2025-03-16 19:37:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:35,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:35,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:35,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:37:35,900 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:35,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash -555963479, now seen corresponding path program 1 times [2025-03-16 19:37:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981611434] [2025-03-16 19:37:35,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:35,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:35,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:35,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,008 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:37:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981611434] [2025-03-16 19:37:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981611434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054796425] [2025-03-16 19:37:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:37:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:37:36,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:37:36,010 INFO L87 Difference]: Start difference. First operand 9827 states and 14515 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:37:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:36,097 INFO L93 Difference]: Finished difference Result 23905 states and 35433 transitions. [2025-03-16 19:37:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:37:36,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 123 [2025-03-16 19:37:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:36,111 INFO L225 Difference]: With dead ends: 23905 [2025-03-16 19:37:36,111 INFO L226 Difference]: Without dead ends: 14279 [2025-03-16 19:37:36,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:37:36,117 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 117 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:36,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 591 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14279 states. [2025-03-16 19:37:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14279 to 14213. [2025-03-16 19:37:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14213 states, 14212 states have (on average 1.4717844075429214) internal successors, (20917), 14212 states have internal predecessors, (20917), 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:37:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14213 states to 14213 states and 20917 transitions. [2025-03-16 19:37:36,324 INFO L78 Accepts]: Start accepts. Automaton has 14213 states and 20917 transitions. Word has length 123 [2025-03-16 19:37:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:36,324 INFO L471 AbstractCegarLoop]: Abstraction has 14213 states and 20917 transitions. [2025-03-16 19:37:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:37:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14213 states and 20917 transitions. [2025-03-16 19:37:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:36,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:36,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:37:36,325 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash -523759408, now seen corresponding path program 1 times [2025-03-16 19:37:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441302506] [2025-03-16 19:37:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:36,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:36,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:36,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:36,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,514 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:37:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441302506] [2025-03-16 19:37:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441302506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:37:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427182133] [2025-03-16 19:37:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:36,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:36,516 INFO L87 Difference]: Start difference. First operand 14213 states and 20917 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:37:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:36,557 INFO L93 Difference]: Finished difference Result 14279 states and 21014 transitions. [2025-03-16 19:37:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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 123 [2025-03-16 19:37:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:36,571 INFO L225 Difference]: With dead ends: 14279 [2025-03-16 19:37:36,571 INFO L226 Difference]: Without dead ends: 14277 [2025-03-16 19:37:36,576 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:37:36,576 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:36,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 965 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14277 states. [2025-03-16 19:37:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14277 to 14277. [2025-03-16 19:37:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14277 states, 14276 states have (on average 1.4647660409078174) internal successors, (20911), 14276 states have internal predecessors, (20911), 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:37:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14277 states to 14277 states and 20911 transitions. [2025-03-16 19:37:36,783 INFO L78 Accepts]: Start accepts. Automaton has 14277 states and 20911 transitions. Word has length 123 [2025-03-16 19:37:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:36,783 INFO L471 AbstractCegarLoop]: Abstraction has 14277 states and 20911 transitions. [2025-03-16 19:37:36,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:37:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14277 states and 20911 transitions. [2025-03-16 19:37:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:36,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:37:36,784 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -713215109, now seen corresponding path program 1 times [2025-03-16 19:37:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98127199] [2025-03-16 19:37:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:36,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:36,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:36,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:36,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:39,341 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:37:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98127199] [2025-03-16 19:37:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98127199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2025-03-16 19:37:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656519747] [2025-03-16 19:37:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:39,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 19:37:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:39,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 19:37:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1834, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 19:37:39,347 INFO L87 Difference]: Start difference. First operand 14277 states and 20911 transitions. Second operand has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 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:37:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:47,159 INFO L93 Difference]: Finished difference Result 28761 states and 42131 transitions. [2025-03-16 19:37:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-16 19:37:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 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 123 [2025-03-16 19:37:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:47,182 INFO L225 Difference]: With dead ends: 28761 [2025-03-16 19:37:47,182 INFO L226 Difference]: Without dead ends: 25931 [2025-03-16 19:37:47,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=981, Invalid=5991, Unknown=0, NotChecked=0, Total=6972 [2025-03-16 19:37:47,192 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 3166 mSDsluCounter, 13994 mSDsCounter, 0 mSdLazyCounter, 10355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3166 SdHoareTripleChecker+Valid, 14655 SdHoareTripleChecker+Invalid, 10355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:47,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3166 Valid, 14655 Invalid, 10355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10355 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 19:37:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25931 states. [2025-03-16 19:37:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25931 to 14299. [2025-03-16 19:37:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14299 states, 14298 states have (on average 1.4644006154706952) internal successors, (20938), 14298 states have internal predecessors, (20938), 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:37:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 20938 transitions. [2025-03-16 19:37:47,359 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 20938 transitions. Word has length 123 [2025-03-16 19:37:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:47,359 INFO L471 AbstractCegarLoop]: Abstraction has 14299 states and 20938 transitions. [2025-03-16 19:37:47,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 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:37:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 20938 transitions. [2025-03-16 19:37:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:47,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:47,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:47,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:37:47,360 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:47,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash -445373565, now seen corresponding path program 1 times [2025-03-16 19:37:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046648948] [2025-03-16 19:37:47,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:47,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:47,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:47,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,018 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:37:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046648948] [2025-03-16 19:37:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046648948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:37:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676880386] [2025-03-16 19:37:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:37:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:37:48,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:37:48,019 INFO L87 Difference]: Start difference. First operand 14299 states and 20938 transitions. Second operand has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 18 states have internal predecessors, (123), 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:37:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:49,180 INFO L93 Difference]: Finished difference Result 45898 states and 67365 transitions. [2025-03-16 19:37:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:37:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 18 states have internal predecessors, (123), 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 123 [2025-03-16 19:37:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:49,215 INFO L225 Difference]: With dead ends: 45898 [2025-03-16 19:37:49,215 INFO L226 Difference]: Without dead ends: 42520 [2025-03-16 19:37:49,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:37:49,229 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1329 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 4447 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:49,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 4447 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:37:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42520 states. [2025-03-16 19:37:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42520 to 14277. [2025-03-16 19:37:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14277 states, 14276 states have (on average 1.4645558980106472) internal successors, (20908), 14276 states have internal predecessors, (20908), 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:37:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14277 states to 14277 states and 20908 transitions. [2025-03-16 19:37:49,454 INFO L78 Accepts]: Start accepts. Automaton has 14277 states and 20908 transitions. Word has length 123 [2025-03-16 19:37:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:49,454 INFO L471 AbstractCegarLoop]: Abstraction has 14277 states and 20908 transitions. [2025-03-16 19:37:49,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 18 states have internal predecessors, (123), 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:37:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14277 states and 20908 transitions. [2025-03-16 19:37:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:37:49,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:49,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:37:49,454 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:49,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1542013337, now seen corresponding path program 1 times [2025-03-16 19:37:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420586618] [2025-03-16 19:37:49,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:37:49,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:37:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420586618] [2025-03-16 19:37:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420586618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:37:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862005601] [2025-03-16 19:37:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:49,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:37:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:49,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:37:49,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:37:49,807 INFO L87 Difference]: Start difference. First operand 14277 states and 20908 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 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:37:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:50,285 INFO L93 Difference]: Finished difference Result 31764 states and 46608 transitions. [2025-03-16 19:37:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:37:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 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 124 [2025-03-16 19:37:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:50,314 INFO L225 Difference]: With dead ends: 31764 [2025-03-16 19:37:50,314 INFO L226 Difference]: Without dead ends: 28368 [2025-03-16 19:37:50,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:37:50,324 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1048 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:50,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2193 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28368 states. [2025-03-16 19:37:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28368 to 14259. [2025-03-16 19:37:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14259 states, 14258 states have (on average 1.4649319680179549) internal successors, (20887), 14258 states have internal predecessors, (20887), 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:37:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14259 states to 14259 states and 20887 transitions. [2025-03-16 19:37:50,565 INFO L78 Accepts]: Start accepts. Automaton has 14259 states and 20887 transitions. Word has length 124 [2025-03-16 19:37:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:50,566 INFO L471 AbstractCegarLoop]: Abstraction has 14259 states and 20887 transitions. [2025-03-16 19:37:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 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:37:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14259 states and 20887 transitions. [2025-03-16 19:37:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:37:50,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:50,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:37:50,566 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -83017598, now seen corresponding path program 1 times [2025-03-16 19:37:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754399122] [2025-03-16 19:37:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:50,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:37:50,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:37:50,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:50,923 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:37:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754399122] [2025-03-16 19:37:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754399122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:37:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545697317] [2025-03-16 19:37:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:50,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:37:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:50,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:37:50,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:37:50,924 INFO L87 Difference]: Start difference. First operand 14259 states and 20887 transitions. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 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:37:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:51,235 INFO L93 Difference]: Finished difference Result 30617 states and 44951 transitions. [2025-03-16 19:37:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:37:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 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 124 [2025-03-16 19:37:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:51,260 INFO L225 Difference]: With dead ends: 30617 [2025-03-16 19:37:51,260 INFO L226 Difference]: Without dead ends: 27756 [2025-03-16 19:37:51,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:37:51,270 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 815 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:51,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1915 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27756 states. [2025-03-16 19:37:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27756 to 13954. [2025-03-16 19:37:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13954 states, 13953 states have (on average 1.4659213072457535) internal successors, (20454), 13953 states have internal predecessors, (20454), 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:37:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 20454 transitions. [2025-03-16 19:37:51,441 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 20454 transitions. Word has length 124 [2025-03-16 19:37:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:51,441 INFO L471 AbstractCegarLoop]: Abstraction has 13954 states and 20454 transitions. [2025-03-16 19:37:51,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 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:37:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 20454 transitions. [2025-03-16 19:37:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:37:51,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:51,443 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:51,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:37:51,444 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 284386000, now seen corresponding path program 1 times [2025-03-16 19:37:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137411217] [2025-03-16 19:37:51,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:51,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:37:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:37:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137411217] [2025-03-16 19:37:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137411217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93812385] [2025-03-16 19:37:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:51,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:51,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:51,528 INFO L87 Difference]: Start difference. First operand 13954 states and 20454 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:51,835 INFO L93 Difference]: Finished difference Result 47724 states and 70439 transitions. [2025-03-16 19:37:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:37:51,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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 159 [2025-03-16 19:37:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:51,866 INFO L225 Difference]: With dead ends: 47724 [2025-03-16 19:37:51,867 INFO L226 Difference]: Without dead ends: 33922 [2025-03-16 19:37:51,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:37:51,882 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1070 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:51,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 620 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33922 states. [2025-03-16 19:37:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33922 to 20688. [2025-03-16 19:37:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20688 states, 20687 states have (on average 1.4675400009667907) internal successors, (30359), 20687 states have internal predecessors, (30359), 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:37:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20688 states to 20688 states and 30359 transitions. [2025-03-16 19:37:52,093 INFO L78 Accepts]: Start accepts. Automaton has 20688 states and 30359 transitions. Word has length 159 [2025-03-16 19:37:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:52,093 INFO L471 AbstractCegarLoop]: Abstraction has 20688 states and 30359 transitions. [2025-03-16 19:37:52,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 20688 states and 30359 transitions. [2025-03-16 19:37:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:37:52,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:52,096 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:37:52,096 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2091921936, now seen corresponding path program 1 times [2025-03-16 19:37:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:52,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970558676] [2025-03-16 19:37:52,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:52,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:37:52,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:37:52,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:52,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970558676] [2025-03-16 19:37:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970558676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905108175] [2025-03-16 19:37:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:52,182 INFO L87 Difference]: Start difference. First operand 20688 states and 30359 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:52,561 INFO L93 Difference]: Finished difference Result 85972 states and 126821 transitions. [2025-03-16 19:37:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:37:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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 159 [2025-03-16 19:37:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:52,623 INFO L225 Difference]: With dead ends: 85972 [2025-03-16 19:37:52,623 INFO L226 Difference]: Without dead ends: 65474 [2025-03-16 19:37:52,642 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:37:52,642 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1424 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:52,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 487 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65474 states. [2025-03-16 19:37:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65474 to 43824. [2025-03-16 19:37:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43824 states, 43823 states have (on average 1.465006959815622) internal successors, (64201), 43823 states have internal predecessors, (64201), 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:37:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43824 states to 43824 states and 64201 transitions. [2025-03-16 19:37:53,073 INFO L78 Accepts]: Start accepts. Automaton has 43824 states and 64201 transitions. Word has length 159 [2025-03-16 19:37:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 43824 states and 64201 transitions. [2025-03-16 19:37:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 43824 states and 64201 transitions. [2025-03-16 19:37:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:37:53,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:53,173 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:37:53,173 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:53,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1145659056, now seen corresponding path program 1 times [2025-03-16 19:37:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149659920] [2025-03-16 19:37:53,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:53,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:37:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:37:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149659920] [2025-03-16 19:37:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149659920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:53,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:53,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699548178] [2025-03-16 19:37:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:53,316 INFO L87 Difference]: Start difference. First operand 43824 states and 64201 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:53,815 INFO L93 Difference]: Finished difference Result 169108 states and 248675 transitions. [2025-03-16 19:37:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:37:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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 159 [2025-03-16 19:37:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:53,959 INFO L225 Difference]: With dead ends: 169108 [2025-03-16 19:37:53,959 INFO L226 Difference]: Without dead ends: 125474 [2025-03-16 19:37:54,019 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:37:54,021 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1339 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 485 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125474 states. [2025-03-16 19:37:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125474 to 92736. [2025-03-16 19:37:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92736 states, 92735 states have (on average 1.4620262036987113) internal successors, (135581), 92735 states have internal predecessors, (135581), 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:37:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92736 states to 92736 states and 135581 transitions. [2025-03-16 19:37:55,072 INFO L78 Accepts]: Start accepts. Automaton has 92736 states and 135581 transitions. Word has length 159 [2025-03-16 19:37:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 92736 states and 135581 transitions. [2025-03-16 19:37:55,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 92736 states and 135581 transitions. [2025-03-16 19:37:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:37:55,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:55,078 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:37:55,078 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1668669552, now seen corresponding path program 1 times [2025-03-16 19:37:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305360460] [2025-03-16 19:37:55,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:37:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:37:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305360460] [2025-03-16 19:37:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305360460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092581418] [2025-03-16 19:37:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:55,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:55,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:55,167 INFO L87 Difference]: Start difference. First operand 92736 states and 135581 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:56,234 INFO L93 Difference]: Finished difference Result 332740 states and 487631 transitions. [2025-03-16 19:37:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:37:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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 159 [2025-03-16 19:37:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:56,503 INFO L225 Difference]: With dead ends: 332740 [2025-03-16 19:37:56,503 INFO L226 Difference]: Without dead ends: 240194 [2025-03-16 19:37:56,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:37:56,555 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1254 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:56,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 483 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240194 states. [2025-03-16 19:37:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240194 to 195840. [2025-03-16 19:37:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195840 states, 195839 states have (on average 1.4590199092111378) internal successors, (285733), 195839 states have internal predecessors, (285733), 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:37:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195840 states to 195840 states and 285733 transitions. [2025-03-16 19:37:59,357 INFO L78 Accepts]: Start accepts. Automaton has 195840 states and 285733 transitions. Word has length 159 [2025-03-16 19:37:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:59,357 INFO L471 AbstractCegarLoop]: Abstraction has 195840 states and 285733 transitions. [2025-03-16 19:37:59,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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:37:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 195840 states and 285733 transitions. [2025-03-16 19:37:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:37:59,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:59,369 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:37:59,369 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1385715792, now seen corresponding path program 1 times [2025-03-16 19:37:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753695811] [2025-03-16 19:37:59,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:37:59,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:37:59,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:59,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753695811] [2025-03-16 19:37:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753695811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486449119] [2025-03-16 19:37:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:59,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:59,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:59,614 INFO L87 Difference]: Start difference. First operand 195840 states and 285733 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 6 states have internal predecessors, (159), 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)