./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-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 820426658db97058309ccbf6c9080e1e23ba9878004c38e814dfcfedaf40875a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:08:27,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:08:27,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:08:27,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:08:27,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:08:27,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:08:27,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:08:27,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:08:27,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:08:27,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:08:27,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:08:27,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:08:27,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:08:27,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:08:27,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:08:27,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:08:27,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:08:27,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:08:27,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:27,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:08:27,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:08:27,327 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 -> 820426658db97058309ccbf6c9080e1e23ba9878004c38e814dfcfedaf40875a [2025-03-03 15:08:27,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:08:27,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:08:27,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:08:27,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:08:27,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:08:27,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:08:28,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afd37cfc/f6fb40229bcf48ec98f3de9cc3d2a48b/FLAGda7353a31 [2025-03-03 15:08:29,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:08:29,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:08:29,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afd37cfc/f6fb40229bcf48ec98f3de9cc3d2a48b/FLAGda7353a31 [2025-03-03 15:08:29,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afd37cfc/f6fb40229bcf48ec98f3de9cc3d2a48b [2025-03-03 15:08:29,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:08:29,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:08:29,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:29,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:08:29,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:08:29,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:29" (1/1) ... [2025-03-03 15:08:29,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a80055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:29, skipping insertion in model container [2025-03-03 15:08:29,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:29" (1/1) ... [2025-03-03 15:08:29,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:08:29,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11898,11911] [2025-03-03 15:08:29,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18616,18629] [2025-03-03 15:08:29,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20814,20827] [2025-03-03 15:08:29,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21891,21904] [2025-03-03 15:08:29,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25244,25257] [2025-03-03 15:08:29,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26324,26337] [2025-03-03 15:08:29,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28553,28566] [2025-03-03 15:08:29,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:29,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:08:29,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11898,11911] [2025-03-03 15:08:29,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18616,18629] [2025-03-03 15:08:29,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20814,20827] [2025-03-03 15:08:29,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21891,21904] [2025-03-03 15:08:29,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25244,25257] [2025-03-03 15:08:29,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26324,26337] [2025-03-03 15:08:29,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28553,28566] [2025-03-03 15:08:30,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:30,126 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:08:30,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30 WrapperNode [2025-03-03 15:08:30,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:30,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:30,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:08:30,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:08:30,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,319 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7044 [2025-03-03 15:08:30,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:30,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:08:30,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:08:30,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:08:30,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,399 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:08:30,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:08:30,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:08:30,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:08:30,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:08:30,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (1/1) ... [2025-03-03 15:08:30,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:30,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:30,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:08:30,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:08:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:08:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:08:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:08:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:08:30,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:08:30,836 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:08:33,450 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4990: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~60#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4198: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10541: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~147#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10013: havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~139#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8560: havoc main_~node4__m4~34#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10146: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~141#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3936: havoc main_~node4__m4~16#1; [2025-03-03 15:08:33,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9090: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~124#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5259: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8298: havoc main_~node3__m3~11#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7770: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9356: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~128#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11075: havoc main_~node4__m4~44#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4470: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6584: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~85#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5395: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7906: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5528: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~68#1; [2025-03-03 15:08:33,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6189: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~79#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4208: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6455: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~83#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4606: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8570: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node4__m4~0#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7513: havoc main_~node4__m4~30#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3946: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2889: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3022: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8043: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~108#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7251: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8308: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~33#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8706: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~118#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-03 15:08:33,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4082: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11085: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L779: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6989: havoc main_~node4__m4~28#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4743: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~56#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1837: havoc main_~check__tmp~13#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9766: havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~135#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10427: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~145#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4217: havoc main_~node4__m4~17#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9899: havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~137#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3689: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11221: havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~158#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8843: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~120#1; [2025-03-03 15:08:33,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7523: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8317: havoc main_~node4__m4~33#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10828: havoc main_~node4__m4~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7261: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~102#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5942: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~75#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6999: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6075: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~77#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4227: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6341: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~81#1; [2025-03-03 15:08:33,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2642: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3699: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5285: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~64#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7135: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7796: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~104#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1454: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: 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-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4363: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7270: havoc main_~node4__m4~29#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8327: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3835: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10838: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4496: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~52#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1193: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:08:33,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5157: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~63#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9652: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~133#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3442: havoc main_~node4__m4~14#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8463: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~114#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10974: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~154#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8596: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~116#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3972: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~44#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9257: havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~127#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc main_~node3__m3~6#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9523: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~131#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10581: havoc main_~node4__m4~42#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11111: havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~156#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7280: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10319: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5695: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~71#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6752: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L807: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5828: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~73#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10057: havoc main_~node4__m4~40#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601: havoc main_~node2__m2~3#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7416: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7549: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~100#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8210: havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~111#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3190: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3588: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6495: havoc main_~node4__m4~26#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10591: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4910: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~59#1; [2025-03-03 15:08:33,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5043: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~61#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7025: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~92#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6233: havoc main_~node3__m3~9#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10329: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node2__m2~2#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10727: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~150#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4253: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~48#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10067: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~123#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3725: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~40#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: havoc main_~node4__m4~12#1; [2025-03-03 15:08:33,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9143: havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~125#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc main_~node4__m4~13#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9409: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~129#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10203: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~142#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8353: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~112#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10864: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~152#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: havoc main_~check__tmp~15#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6505: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L956: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5581: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~69#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10338: havoc main_~node4__m4~41#1; [2025-03-03 15:08:33,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9810: havoc main_~node4__m4~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618: havoc main_~node3__m3~4#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1486: havoc main_~check__tmp~9#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6243: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5452: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~67#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7963: havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~107#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8096: havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~109#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2943: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4663: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~55#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7306: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~96#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:08:33,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6778: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~88#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4796: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~57#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5986: havoc main_~node4__m4~24#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10348: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6252: havoc main_~node4__m4~25#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9820: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8763: havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~119#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node3__m3~2#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3478: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~36#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4139: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~47#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2686: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8896: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~121#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10484: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~146#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~138#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10617: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~148#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11278: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~159#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1369: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1635: havoc main_~node4__m4~6#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9563: havoc main_~node4__m4~38#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5996: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108: havoc main_~node4__m4~3#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10093: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~140#1; [2025-03-03 15:08:33,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1769: havoc main_~node4__m4~7#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9301: havoc main_~node3__m3~12#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6262: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7716: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~103#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5338: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~65#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7849: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~105#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node2__m2~1#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6132: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6398: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~84#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4549: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~53#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5210: havoc main_~node2__m2~4#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7192: havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~95#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5739: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9573: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4420: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~51#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3892: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~43#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4__m4~2#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439: havoc main_~node4__m4~10#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8649: havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~117#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4025: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~45#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9311: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9709: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8520: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~115#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3235: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~32#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11031: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~155#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11164: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~157#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4954: havoc main_~node4__m4~20#1; [2025-03-03 15:08:33,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5220: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:33,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5749: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:08:33,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10374: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~144#1; [2025-03-03 15:08:33,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9846: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~136#1; [2025-03-03 15:08:33,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9054: havoc main_~node4__m4~36#1; [2025-03-03 15:08:33,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7602: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~101#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node3__m3~1#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9320: havoc main_~node4__m4~37#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5885: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7473: havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~99#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6945: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~91#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2585: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~0#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5492: havoc main_~node4__m4~22#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7078: havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~93#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4964: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:08:33,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6022: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~76#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5230: havoc main_~node3__m3~8#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927: havoc main_~node3__m3~5#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3645: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~39#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4306: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~49#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1267: havoc main_~node3__m3~3#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6288: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~80#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3778: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~41#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8007: havoc main_~node4__m4~32#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9064: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9330: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10784: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~151#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8406: havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~113#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10917: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~153#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4707: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9200: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1669: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5502: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9466: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~130#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-03 15:08:33,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1142: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9599: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~132#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8278: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10260: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~143#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8807: havoc main_~node4__m4~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5240: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node4__m4~1#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5638: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:08:33,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8017: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6698: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~87#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7359: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~97#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~89#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4717: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8153: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~110#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5775: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~72#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: havoc main_~node4__m4~8#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node3__m3~0#1; [2025-03-03 15:08:33,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284: havoc main_~node4__m4~4#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3531: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~37#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2342: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5249: havoc main_~node4__m4~21#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8288: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7760: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8817: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418: havoc main_~node4__m4~5#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2475: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3136: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3402: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~35#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10670: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~149#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4460: havoc main_~node4__m4~18#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L893: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:33,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8953: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~122#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-03 15:08:33,720 INFO L? ?]: Removed 1112 outVars from TransFormulas that were not future-live. [2025-03-03 15:08:33,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:08:33,760 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:08:33,760 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:08:33,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:33 BoogieIcfgContainer [2025-03-03 15:08:33,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:08:33,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:08:33,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:08:33,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:08:33,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:08:29" (1/3) ... [2025-03-03 15:08:33,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fb301c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:33, skipping insertion in model container [2025-03-03 15:08:33,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:30" (2/3) ... [2025-03-03 15:08:33,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fb301c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:33, skipping insertion in model container [2025-03-03 15:08:33,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:33" (3/3) ... [2025-03-03 15:08:33,768 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:08:33,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:08:33,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1102 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-03 15:08:33,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:08:33,868 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;@2e2dae6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:08:33,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-03 15:08:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 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-03 15:08:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:08:33,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:33,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:33,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1880454602, now seen corresponding path program 1 times [2025-03-03 15:08:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346649894] [2025-03-03 15:08:33,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:33,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:08:34,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:08:34,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346649894] [2025-03-03 15:08:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346649894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:34,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992219928] [2025-03-03 15:08:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:34,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:34,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:34,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:34,299 INFO L87 Difference]: Start difference. First operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 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 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:34,504 INFO L93 Difference]: Finished difference Result 1455 states and 2640 transitions. [2025-03-03 15:08:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:34,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:08:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:34,518 INFO L225 Difference]: With dead ends: 1455 [2025-03-03 15:08:34,518 INFO L226 Difference]: Without dead ends: 1281 [2025-03-03 15:08:34,521 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-03 15:08:34,523 INFO L435 NwaCegarLoop]: 2050 mSDtfsCounter, 966 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 3320 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-03-03 15:08:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1273. [2025-03-03 15:08:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1266 states have (on average 1.319905213270142) internal successors, (1671), 1272 states have internal predecessors, (1671), 0 states have call successors, (0), 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-03 15:08:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1671 transitions. [2025-03-03 15:08:34,592 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1671 transitions. Word has length 63 [2025-03-03 15:08:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:34,592 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1671 transitions. [2025-03-03 15:08:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1671 transitions. [2025-03-03 15:08:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:08:34,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:34,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:34,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:08:34,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash 775252650, now seen corresponding path program 1 times [2025-03-03 15:08:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804233615] [2025-03-03 15:08:34,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:34,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:08:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:08:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:34,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:34,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804233615] [2025-03-03 15:08:34,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804233615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:34,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743916903] [2025-03-03 15:08:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:34,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:34,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:34,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:34,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:34,786 INFO L87 Difference]: Start difference. First operand 1273 states and 1671 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:35,313 INFO L93 Difference]: Finished difference Result 2245 states and 3045 transitions. [2025-03-03 15:08:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:08:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:35,319 INFO L225 Difference]: With dead ends: 2245 [2025-03-03 15:08:35,319 INFO L226 Difference]: Without dead ends: 1280 [2025-03-03 15:08:35,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:35,322 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 3659 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:35,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3659 Valid, 829 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-03 15:08:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1272. [2025-03-03 15:08:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1265 states have (on average 1.3754940711462451) internal successors, (1740), 1271 states have internal predecessors, (1740), 0 states have call successors, (0), 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-03 15:08:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1740 transitions. [2025-03-03 15:08:35,354 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1740 transitions. Word has length 63 [2025-03-03 15:08:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1740 transitions. [2025-03-03 15:08:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1740 transitions. [2025-03-03 15:08:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:08:35,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:35,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:35,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:35,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1858727269, now seen corresponding path program 1 times [2025-03-03 15:08:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057654288] [2025-03-03 15:08:35,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:35,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:08:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:08:35,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057654288] [2025-03-03 15:08:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057654288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327319022] [2025-03-03 15:08:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:35,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:35,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:35,565 INFO L87 Difference]: Start difference. First operand 1272 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,019 INFO L93 Difference]: Finished difference Result 2256 states and 3146 transitions. [2025-03-03 15:08:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:08:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,024 INFO L225 Difference]: With dead ends: 2256 [2025-03-03 15:08:36,024 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 15:08:36,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:36,026 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 3055 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 691 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 15:08:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1388. [2025-03-03 15:08:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1381 states have (on average 1.3700217233888488) internal successors, (1892), 1387 states have internal predecessors, (1892), 0 states have call successors, (0), 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-03 15:08:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1892 transitions. [2025-03-03 15:08:36,051 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1892 transitions. Word has length 64 [2025-03-03 15:08:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,052 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1892 transitions. [2025-03-03 15:08:36,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1892 transitions. [2025-03-03 15:08:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:08:36,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:36,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:36,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -961380577, now seen corresponding path program 1 times [2025-03-03 15:08:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641466544] [2025-03-03 15:08:36,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:08:36,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:08:36,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641466544] [2025-03-03 15:08:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641466544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117268669] [2025-03-03 15:08:36,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:36,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:36,218 INFO L87 Difference]: Start difference. First operand 1388 states and 1892 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,552 INFO L93 Difference]: Finished difference Result 3065 states and 4328 transitions. [2025-03-03 15:08:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:08:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,560 INFO L225 Difference]: With dead ends: 3065 [2025-03-03 15:08:36,560 INFO L226 Difference]: Without dead ends: 1881 [2025-03-03 15:08:36,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:36,563 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 2720 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2720 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2720 Valid, 642 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-03-03 15:08:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1873. [2025-03-03 15:08:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1866 states have (on average 1.422293676312969) internal successors, (2654), 1872 states have internal predecessors, (2654), 0 states have call successors, (0), 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-03 15:08:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2654 transitions. [2025-03-03 15:08:36,596 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2654 transitions. Word has length 64 [2025-03-03 15:08:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,596 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2654 transitions. [2025-03-03 15:08:36,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2654 transitions. [2025-03-03 15:08:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:36,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:36,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -144419334, now seen corresponding path program 1 times [2025-03-03 15:08:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693127140] [2025-03-03 15:08:36,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693127140] [2025-03-03 15:08:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693127140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192556179] [2025-03-03 15:08:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:36,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:36,668 INFO L87 Difference]: Start difference. First operand 1873 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,709 INFO L93 Difference]: Finished difference Result 3898 states and 5614 transitions. [2025-03-03 15:08:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:08:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,718 INFO L225 Difference]: With dead ends: 3898 [2025-03-03 15:08:36,718 INFO L226 Difference]: Without dead ends: 2608 [2025-03-03 15:08:36,721 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-03 15:08:36,722 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 584 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1525 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2025-03-03 15:08:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2594. [2025-03-03 15:08:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2587 states have (on average 1.407035175879397) internal successors, (3640), 2593 states have internal predecessors, (3640), 0 states have call successors, (0), 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-03 15:08:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3640 transitions. [2025-03-03 15:08:36,767 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3640 transitions. Word has length 65 [2025-03-03 15:08:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 2594 states and 3640 transitions. [2025-03-03 15:08:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3640 transitions. [2025-03-03 15:08:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:36,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:36,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 289907694, now seen corresponding path program 1 times [2025-03-03 15:08:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101361737] [2025-03-03 15:08:36,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:36,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:36,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101361737] [2025-03-03 15:08:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101361737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152564064] [2025-03-03 15:08:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:36,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:36,864 INFO L87 Difference]: Start difference. First operand 2594 states and 3640 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,906 INFO L93 Difference]: Finished difference Result 5391 states and 7679 transitions. [2025-03-03 15:08:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:36,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:08:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,918 INFO L225 Difference]: With dead ends: 5391 [2025-03-03 15:08:36,918 INFO L226 Difference]: Without dead ends: 3599 [2025-03-03 15:08:36,921 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-03 15:08:36,921 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 593 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1532 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-03 15:08:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3582. [2025-03-03 15:08:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3575 states have (on average 1.3890909090909092) internal successors, (4966), 3581 states have internal predecessors, (4966), 0 states have call successors, (0), 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-03 15:08:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4966 transitions. [2025-03-03 15:08:36,996 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4966 transitions. Word has length 65 [2025-03-03 15:08:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,996 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4966 transitions. [2025-03-03 15:08:36,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4966 transitions. [2025-03-03 15:08:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:37,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:37,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:37,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -179470074, now seen corresponding path program 1 times [2025-03-03 15:08:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784255197] [2025-03-03 15:08:37,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784255197] [2025-03-03 15:08:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784255197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975285002] [2025-03-03 15:08:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:37,134 INFO L87 Difference]: Start difference. First operand 3582 states and 4966 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,493 INFO L93 Difference]: Finished difference Result 8692 states and 12314 transitions. [2025-03-03 15:08:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:37,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,508 INFO L225 Difference]: With dead ends: 8692 [2025-03-03 15:08:37,508 INFO L226 Difference]: Without dead ends: 5546 [2025-03-03 15:08:37,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:37,513 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 2401 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 580 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2025-03-03 15:08:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5538. [2025-03-03 15:08:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5538 states, 5531 states have (on average 1.4080636412945218) internal successors, (7788), 5537 states have internal predecessors, (7788), 0 states have call successors, (0), 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-03 15:08:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 7788 transitions. [2025-03-03 15:08:37,618 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 7788 transitions. Word has length 66 [2025-03-03 15:08:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 5538 states and 7788 transitions. [2025-03-03 15:08:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 7788 transitions. [2025-03-03 15:08:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:37,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:37,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:37,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1620391163, now seen corresponding path program 1 times [2025-03-03 15:08:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031426842] [2025-03-03 15:08:37,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:37,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:37,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031426842] [2025-03-03 15:08:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031426842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726783275] [2025-03-03 15:08:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:37,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:37,685 INFO L87 Difference]: Start difference. First operand 5538 states and 7788 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,739 INFO L93 Difference]: Finished difference Result 11728 states and 16711 transitions. [2025-03-03 15:08:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,759 INFO L225 Difference]: With dead ends: 11728 [2025-03-03 15:08:37,759 INFO L226 Difference]: Without dead ends: 7452 [2025-03-03 15:08:37,764 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-03 15:08:37,765 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 399 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1179 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-03-03 15:08:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7417. [2025-03-03 15:08:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7417 states, 7410 states have (on average 1.3913630229419702) internal successors, (10310), 7416 states have internal predecessors, (10310), 0 states have call successors, (0), 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-03 15:08:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7417 states to 7417 states and 10310 transitions. [2025-03-03 15:08:37,872 INFO L78 Accepts]: Start accepts. Automaton has 7417 states and 10310 transitions. Word has length 66 [2025-03-03 15:08:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:37,872 INFO L471 AbstractCegarLoop]: Abstraction has 7417 states and 10310 transitions. [2025-03-03 15:08:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7417 states and 10310 transitions. [2025-03-03 15:08:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:37,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:37,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -859930582, now seen corresponding path program 1 times [2025-03-03 15:08:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742810056] [2025-03-03 15:08:37,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:37,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:38,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:38,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742810056] [2025-03-03 15:08:38,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742810056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:38,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:38,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391925207] [2025-03-03 15:08:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:38,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:38,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:38,032 INFO L87 Difference]: Start difference. First operand 7417 states and 10310 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:38,546 INFO L93 Difference]: Finished difference Result 21207 states and 30061 transitions. [2025-03-03 15:08:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:38,576 INFO L225 Difference]: With dead ends: 21207 [2025-03-03 15:08:38,576 INFO L226 Difference]: Without dead ends: 17664 [2025-03-03 15:08:38,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:38,586 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 3205 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:38,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3205 Valid, 1116 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17664 states. [2025-03-03 15:08:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17664 to 7485. [2025-03-03 15:08:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7485 states, 7478 states have (on average 1.3904787376303824) internal successors, (10398), 7484 states have internal predecessors, (10398), 0 states have call successors, (0), 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-03 15:08:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7485 states to 7485 states and 10398 transitions. [2025-03-03 15:08:38,748 INFO L78 Accepts]: Start accepts. Automaton has 7485 states and 10398 transitions. Word has length 67 [2025-03-03 15:08:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 7485 states and 10398 transitions. [2025-03-03 15:08:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7485 states and 10398 transitions. [2025-03-03 15:08:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:38,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:38,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:38,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 91317850, now seen corresponding path program 1 times [2025-03-03 15:08:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:38,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889598052] [2025-03-03 15:08:38,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:38,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:38,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:38,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:38,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:38,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:38,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889598052] [2025-03-03 15:08:38,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889598052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:38,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:38,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406463544] [2025-03-03 15:08:38,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:38,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:38,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:38,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:38,902 INFO L87 Difference]: Start difference. First operand 7485 states and 10398 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:39,429 INFO L93 Difference]: Finished difference Result 19277 states and 27263 transitions. [2025-03-03 15:08:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:39,451 INFO L225 Difference]: With dead ends: 19277 [2025-03-03 15:08:39,451 INFO L226 Difference]: Without dead ends: 15916 [2025-03-03 15:08:39,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:39,458 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 3109 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:39,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3109 Valid, 1098 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15916 states. [2025-03-03 15:08:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15916 to 7607. [2025-03-03 15:08:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7607 states, 7600 states have (on average 1.3894736842105264) internal successors, (10560), 7606 states have internal predecessors, (10560), 0 states have call successors, (0), 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-03 15:08:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 10560 transitions. [2025-03-03 15:08:39,583 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 10560 transitions. Word has length 67 [2025-03-03 15:08:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 7607 states and 10560 transitions. [2025-03-03 15:08:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 10560 transitions. [2025-03-03 15:08:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:39,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:39,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:39,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2026207873, now seen corresponding path program 1 times [2025-03-03 15:08:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834839219] [2025-03-03 15:08:39,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:39,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:39,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834839219] [2025-03-03 15:08:39,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834839219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:39,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:39,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940637585] [2025-03-03 15:08:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:39,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:39,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:39,701 INFO L87 Difference]: Start difference. First operand 7607 states and 10560 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,125 INFO L93 Difference]: Finished difference Result 15804 states and 22241 transitions. [2025-03-03 15:08:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,141 INFO L225 Difference]: With dead ends: 15804 [2025-03-03 15:08:40,141 INFO L226 Difference]: Without dead ends: 12242 [2025-03-03 15:08:40,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:40,147 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2861 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 1054 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12242 states. [2025-03-03 15:08:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12242 to 7642. [2025-03-03 15:08:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7642 states, 7635 states have (on average 1.3889980353634577) internal successors, (10605), 7641 states have internal predecessors, (10605), 0 states have call successors, (0), 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-03 15:08:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7642 states to 7642 states and 10605 transitions. [2025-03-03 15:08:40,291 INFO L78 Accepts]: Start accepts. Automaton has 7642 states and 10605 transitions. Word has length 67 [2025-03-03 15:08:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:40,291 INFO L471 AbstractCegarLoop]: Abstraction has 7642 states and 10605 transitions. [2025-03-03 15:08:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7642 states and 10605 transitions. [2025-03-03 15:08:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:40,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:40,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:40,298 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -851503613, now seen corresponding path program 1 times [2025-03-03 15:08:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821928272] [2025-03-03 15:08:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:40,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:40,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:40,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:40,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821928272] [2025-03-03 15:08:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821928272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084270169] [2025-03-03 15:08:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:40,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:40,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:40,427 INFO L87 Difference]: Start difference. First operand 7642 states and 10605 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,933 INFO L93 Difference]: Finished difference Result 17446 states and 24598 transitions. [2025-03-03 15:08:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,952 INFO L225 Difference]: With dead ends: 17446 [2025-03-03 15:08:40,953 INFO L226 Difference]: Without dead ends: 14349 [2025-03-03 15:08:40,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:40,960 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 3032 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3032 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3032 Valid, 1079 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14349 states. [2025-03-03 15:08:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14349 to 7713. [2025-03-03 15:08:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7713 states, 7706 states have (on average 1.3890474954580847) internal successors, (10704), 7712 states have internal predecessors, (10704), 0 states have call successors, (0), 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-03 15:08:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7713 states to 7713 states and 10704 transitions. [2025-03-03 15:08:41,077 INFO L78 Accepts]: Start accepts. Automaton has 7713 states and 10704 transitions. Word has length 67 [2025-03-03 15:08:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 7713 states and 10704 transitions. [2025-03-03 15:08:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7713 states and 10704 transitions. [2025-03-03 15:08:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:41,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:41,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1232705370, now seen corresponding path program 1 times [2025-03-03 15:08:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234937148] [2025-03-03 15:08:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234937148] [2025-03-03 15:08:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234937148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:08:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589064599] [2025-03-03 15:08:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:08:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:08:41,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:08:41,346 INFO L87 Difference]: Start difference. First operand 7713 states and 10704 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:42,007 INFO L93 Difference]: Finished difference Result 19152 states and 27194 transitions. [2025-03-03 15:08:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:42,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,028 INFO L225 Difference]: With dead ends: 19152 [2025-03-03 15:08:42,029 INFO L226 Difference]: Without dead ends: 13801 [2025-03-03 15:08:42,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:42,038 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 2288 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 1692 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-03-03 15:08:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 7407. [2025-03-03 15:08:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7407 states, 7400 states have (on average 1.387972972972973) internal successors, (10271), 7406 states have internal predecessors, (10271), 0 states have call successors, (0), 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-03 15:08:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7407 states to 7407 states and 10271 transitions. [2025-03-03 15:08:42,149 INFO L78 Accepts]: Start accepts. Automaton has 7407 states and 10271 transitions. Word has length 68 [2025-03-03 15:08:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 7407 states and 10271 transitions. [2025-03-03 15:08:42,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7407 states and 10271 transitions. [2025-03-03 15:08:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:42,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:42,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:42,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:42,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:42,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash 781095791, now seen corresponding path program 1 times [2025-03-03 15:08:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784961721] [2025-03-03 15:08:42,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:42,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:42,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:42,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:42,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784961721] [2025-03-03 15:08:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784961721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375011483] [2025-03-03 15:08:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:42,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:42,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:42,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:42,389 INFO L87 Difference]: Start difference. First operand 7407 states and 10271 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:43,107 INFO L93 Difference]: Finished difference Result 15746 states and 22245 transitions. [2025-03-03 15:08:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:43,117 INFO L225 Difference]: With dead ends: 15746 [2025-03-03 15:08:43,117 INFO L226 Difference]: Without dead ends: 11110 [2025-03-03 15:08:43,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:43,121 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 3469 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3469 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:43,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3469 Valid, 1820 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2025-03-03 15:08:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 7398. [2025-03-03 15:08:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7398 states, 7391 states have (on average 1.3873630090650793) internal successors, (10254), 7397 states have internal predecessors, (10254), 0 states have call successors, (0), 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-03 15:08:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7398 states to 7398 states and 10254 transitions. [2025-03-03 15:08:43,208 INFO L78 Accepts]: Start accepts. Automaton has 7398 states and 10254 transitions. Word has length 68 [2025-03-03 15:08:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,208 INFO L471 AbstractCegarLoop]: Abstraction has 7398 states and 10254 transitions. [2025-03-03 15:08:43,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7398 states and 10254 transitions. [2025-03-03 15:08:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:43,213 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1578892174, now seen corresponding path program 1 times [2025-03-03 15:08:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227737508] [2025-03-03 15:08:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:43,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:43,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227737508] [2025-03-03 15:08:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227737508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231446115] [2025-03-03 15:08:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:43,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:43,440 INFO L87 Difference]: Start difference. First operand 7398 states and 10254 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:44,088 INFO L93 Difference]: Finished difference Result 15887 states and 22450 transitions. [2025-03-03 15:08:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:44,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:44,099 INFO L225 Difference]: With dead ends: 15887 [2025-03-03 15:08:44,099 INFO L226 Difference]: Without dead ends: 11218 [2025-03-03 15:08:44,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:44,104 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 3552 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3552 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3552 Valid, 1765 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11218 states. [2025-03-03 15:08:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11218 to 7374. [2025-03-03 15:08:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7374 states, 7367 states have (on average 1.3865888421338401) internal successors, (10215), 7373 states have internal predecessors, (10215), 0 states have call successors, (0), 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-03 15:08:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 10215 transitions. [2025-03-03 15:08:44,183 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 10215 transitions. Word has length 68 [2025-03-03 15:08:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:44,183 INFO L471 AbstractCegarLoop]: Abstraction has 7374 states and 10215 transitions. [2025-03-03 15:08:44,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 10215 transitions. [2025-03-03 15:08:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:44,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:44,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:44,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:44,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:44,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -875626333, now seen corresponding path program 1 times [2025-03-03 15:08:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178962057] [2025-03-03 15:08:44,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:44,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:44,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:44,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:44,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:44,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178962057] [2025-03-03 15:08:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178962057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:44,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:44,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366357623] [2025-03-03 15:08:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:44,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:44,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:44,385 INFO L87 Difference]: Start difference. First operand 7374 states and 10215 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:44,975 INFO L93 Difference]: Finished difference Result 16022 states and 22626 transitions. [2025-03-03 15:08:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:44,988 INFO L225 Difference]: With dead ends: 16022 [2025-03-03 15:08:44,988 INFO L226 Difference]: Without dead ends: 11129 [2025-03-03 15:08:44,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:44,996 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 3416 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3416 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:44,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3416 Valid, 1910 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11129 states. [2025-03-03 15:08:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11129 to 7239. [2025-03-03 15:08:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7239 states, 7232 states have (on average 1.3863384955752212) internal successors, (10026), 7238 states have internal predecessors, (10026), 0 states have call successors, (0), 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-03 15:08:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7239 states to 7239 states and 10026 transitions. [2025-03-03 15:08:45,088 INFO L78 Accepts]: Start accepts. Automaton has 7239 states and 10026 transitions. Word has length 68 [2025-03-03 15:08:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:45,088 INFO L471 AbstractCegarLoop]: Abstraction has 7239 states and 10026 transitions. [2025-03-03 15:08:45,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7239 states and 10026 transitions. [2025-03-03 15:08:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:45,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:45,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:45,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:45,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 805127769, now seen corresponding path program 1 times [2025-03-03 15:08:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003332364] [2025-03-03 15:08:45,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:45,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:45,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:45,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:45,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003332364] [2025-03-03 15:08:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003332364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:45,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:45,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138197883] [2025-03-03 15:08:45,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:45,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:45,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:45,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:45,625 INFO L87 Difference]: Start difference. First operand 7239 states and 10026 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:46,321 INFO L93 Difference]: Finished difference Result 16918 states and 24007 transitions. [2025-03-03 15:08:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:46,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:46,332 INFO L225 Difference]: With dead ends: 16918 [2025-03-03 15:08:46,332 INFO L226 Difference]: Without dead ends: 12285 [2025-03-03 15:08:46,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:46,337 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 3851 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3851 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:46,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3851 Valid, 3262 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12285 states. [2025-03-03 15:08:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12285 to 7225. [2025-03-03 15:08:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7225 states, 7219 states have (on average 1.3853719351710763) internal successors, (10001), 7224 states have internal predecessors, (10001), 0 states have call successors, (0), 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-03 15:08:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 10001 transitions. [2025-03-03 15:08:46,418 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 10001 transitions. Word has length 69 [2025-03-03 15:08:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 7225 states and 10001 transitions. [2025-03-03 15:08:46,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 10001 transitions. [2025-03-03 15:08:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:46,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:46,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:46,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1508672737, now seen corresponding path program 1 times [2025-03-03 15:08:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431926418] [2025-03-03 15:08:46,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:46,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:46,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431926418] [2025-03-03 15:08:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431926418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:46,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685692901] [2025-03-03 15:08:46,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:46,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:46,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:46,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:46,841 INFO L87 Difference]: Start difference. First operand 7225 states and 10001 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,483 INFO L93 Difference]: Finished difference Result 17051 states and 24190 transitions. [2025-03-03 15:08:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:47,496 INFO L225 Difference]: With dead ends: 17051 [2025-03-03 15:08:47,496 INFO L226 Difference]: Without dead ends: 12386 [2025-03-03 15:08:47,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:47,503 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 3755 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:47,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 3356 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2025-03-03 15:08:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 7179. [2025-03-03 15:08:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 7174 states have (on average 1.3847226094229161) internal successors, (9934), 7178 states have internal predecessors, (9934), 0 states have call successors, (0), 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-03 15:08:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 9934 transitions. [2025-03-03 15:08:47,621 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 9934 transitions. Word has length 69 [2025-03-03 15:08:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:47,621 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 9934 transitions. [2025-03-03 15:08:47,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 9934 transitions. [2025-03-03 15:08:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:47,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:47,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:47,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 72358672, now seen corresponding path program 1 times [2025-03-03 15:08:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500331806] [2025-03-03 15:08:47,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:47,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:47,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:47,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:47,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500331806] [2025-03-03 15:08:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500331806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825343474] [2025-03-03 15:08:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:47,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:47,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:47,684 INFO L87 Difference]: Start difference. First operand 7179 states and 9934 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,719 INFO L93 Difference]: Finished difference Result 10770 states and 15041 transitions. [2025-03-03 15:08:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:47,726 INFO L225 Difference]: With dead ends: 10770 [2025-03-03 15:08:47,726 INFO L226 Difference]: Without dead ends: 7183 [2025-03-03 15:08:47,729 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-03 15:08:47,730 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 445 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:47,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1336 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2025-03-03 15:08:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7179. [2025-03-03 15:08:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 7174 states have (on average 1.3748257596877613) internal successors, (9863), 7178 states have internal predecessors, (9863), 0 states have call successors, (0), 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-03 15:08:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 9863 transitions. [2025-03-03 15:08:47,792 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 9863 transitions. Word has length 69 [2025-03-03 15:08:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:47,792 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 9863 transitions. [2025-03-03 15:08:47,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 9863 transitions. [2025-03-03 15:08:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:47,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:47,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:47,797 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:47,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 141951119, now seen corresponding path program 1 times [2025-03-03 15:08:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:47,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170910468] [2025-03-03 15:08:47,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:47,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:48,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:48,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170910468] [2025-03-03 15:08:48,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170910468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:48,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:48,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791627991] [2025-03-03 15:08:48,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:48,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:48,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:48,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:48,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:48,192 INFO L87 Difference]: Start difference. First operand 7179 states and 9863 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:48,756 INFO L93 Difference]: Finished difference Result 11953 states and 16618 transitions. [2025-03-03 15:08:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:48,764 INFO L225 Difference]: With dead ends: 11953 [2025-03-03 15:08:48,765 INFO L226 Difference]: Without dead ends: 10300 [2025-03-03 15:08:48,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:48,768 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 3708 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3708 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:48,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3708 Valid, 3017 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10300 states. [2025-03-03 15:08:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10300 to 7094. [2025-03-03 15:08:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7094 states, 7090 states have (on average 1.3730606488011283) internal successors, (9735), 7093 states have internal predecessors, (9735), 0 states have call successors, (0), 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-03 15:08:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 9735 transitions. [2025-03-03 15:08:48,841 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 9735 transitions. Word has length 69 [2025-03-03 15:08:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 7094 states and 9735 transitions. [2025-03-03 15:08:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 9735 transitions. [2025-03-03 15:08:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:48,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:48,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:48,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:48,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1450865665, now seen corresponding path program 1 times [2025-03-03 15:08:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81646847] [2025-03-03 15:08:48,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:48,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:48,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81646847] [2025-03-03 15:08:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81646847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139907705] [2025-03-03 15:08:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:49,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:49,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:49,181 INFO L87 Difference]: Start difference. First operand 7094 states and 9735 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:49,772 INFO L93 Difference]: Finished difference Result 17314 states and 24240 transitions. [2025-03-03 15:08:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:49,788 INFO L225 Difference]: With dead ends: 17314 [2025-03-03 15:08:49,789 INFO L226 Difference]: Without dead ends: 15527 [2025-03-03 15:08:49,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:49,797 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 4455 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:49,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 1834 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15527 states. [2025-03-03 15:08:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15527 to 6893. [2025-03-03 15:08:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6893 states, 6890 states have (on average 1.372133526850508) internal successors, (9454), 6892 states have internal predecessors, (9454), 0 states have call successors, (0), 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-03 15:08:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 9454 transitions. [2025-03-03 15:08:49,895 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 9454 transitions. Word has length 69 [2025-03-03 15:08:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,895 INFO L471 AbstractCegarLoop]: Abstraction has 6893 states and 9454 transitions. [2025-03-03 15:08:49,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 9454 transitions. [2025-03-03 15:08:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:49,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,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] [2025-03-03 15:08:49,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:49,901 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:49,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash -246377844, now seen corresponding path program 1 times [2025-03-03 15:08:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50206356] [2025-03-03 15:08:49,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:49,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:49,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:49,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50206356] [2025-03-03 15:08:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50206356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:49,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:49,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722603700] [2025-03-03 15:08:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:49,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:49,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:49,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:49,945 INFO L87 Difference]: Start difference. First operand 6893 states and 9454 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-03 15:08:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:50,000 INFO L93 Difference]: Finished difference Result 12624 states and 17514 transitions. [2025-03-03 15:08:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 15:08:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:50,054 INFO L225 Difference]: With dead ends: 12624 [2025-03-03 15:08:50,054 INFO L226 Difference]: Without dead ends: 8540 [2025-03-03 15:08:50,058 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-03 15:08:50,059 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 542 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:50,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 790 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2025-03-03 15:08:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 6401. [2025-03-03 15:08:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6401 states, 6398 states have (on average 1.3788683963738668) internal successors, (8822), 6400 states have internal predecessors, (8822), 0 states have call successors, (0), 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-03 15:08:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8822 transitions. [2025-03-03 15:08:50,178 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 8822 transitions. Word has length 70 [2025-03-03 15:08:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 6401 states and 8822 transitions. [2025-03-03 15:08:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-03 15:08:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 8822 transitions. [2025-03-03 15:08:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:50,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:50,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:50,183 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -817189520, now seen corresponding path program 1 times [2025-03-03 15:08:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987140355] [2025-03-03 15:08:50,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:50,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:50,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:50,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987140355] [2025-03-03 15:08:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987140355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631313521] [2025-03-03 15:08:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:50,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:50,321 INFO L87 Difference]: Start difference. First operand 6401 states and 8822 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:50,816 INFO L93 Difference]: Finished difference Result 13877 states and 19377 transitions. [2025-03-03 15:08:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:08:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:50,829 INFO L225 Difference]: With dead ends: 13877 [2025-03-03 15:08:50,829 INFO L226 Difference]: Without dead ends: 12824 [2025-03-03 15:08:50,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:50,833 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 2606 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:50,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 945 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12824 states. [2025-03-03 15:08:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12824 to 6430. [2025-03-03 15:08:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 6427 states have (on average 1.3787147969503657) internal successors, (8861), 6429 states have internal predecessors, (8861), 0 states have call successors, (0), 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-03 15:08:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 8861 transitions. [2025-03-03 15:08:50,917 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 8861 transitions. Word has length 71 [2025-03-03 15:08:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:50,918 INFO L471 AbstractCegarLoop]: Abstraction has 6430 states and 8861 transitions. [2025-03-03 15:08:50,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 8861 transitions. [2025-03-03 15:08:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:50,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:50,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:50,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:50,923 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:50,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2073457156, now seen corresponding path program 1 times [2025-03-03 15:08:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902909166] [2025-03-03 15:08:50,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:50,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:50,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:50,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902909166] [2025-03-03 15:08:50,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902909166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69874318] [2025-03-03 15:08:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:50,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:50,965 INFO L87 Difference]: Start difference. First operand 6430 states and 8861 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:51,053 INFO L93 Difference]: Finished difference Result 13184 states and 18380 transitions. [2025-03-03 15:08:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:08:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:51,062 INFO L225 Difference]: With dead ends: 13184 [2025-03-03 15:08:51,062 INFO L226 Difference]: Without dead ends: 9217 [2025-03-03 15:08:51,067 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-03 15:08:51,068 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 403 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:51,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 551 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2025-03-03 15:08:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 9188. [2025-03-03 15:08:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9188 states, 9186 states have (on average 1.400609623339865) internal successors, (12866), 9187 states have internal predecessors, (12866), 0 states have call successors, (0), 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-03 15:08:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 12866 transitions. [2025-03-03 15:08:51,184 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 12866 transitions. Word has length 71 [2025-03-03 15:08:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:51,184 INFO L471 AbstractCegarLoop]: Abstraction has 9188 states and 12866 transitions. [2025-03-03 15:08:51,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 12866 transitions. [2025-03-03 15:08:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:51,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:51,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:51,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -651467907, now seen corresponding path program 1 times [2025-03-03 15:08:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018658642] [2025-03-03 15:08:51,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:51,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:51,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:51,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:51,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:51,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-03 15:08:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018658642] [2025-03-03 15:08:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018658642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:51,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705216664] [2025-03-03 15:08:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:51,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:51,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:51,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:51,408 INFO L87 Difference]: Start difference. First operand 9188 states and 12866 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 15:08:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:51,906 INFO L93 Difference]: Finished difference Result 17262 states and 24370 transitions. [2025-03-03 15:08:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-03 15:08:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:51,919 INFO L225 Difference]: With dead ends: 17262 [2025-03-03 15:08:51,919 INFO L226 Difference]: Without dead ends: 14618 [2025-03-03 15:08:51,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:51,925 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2424 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:51,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 1160 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14618 states. [2025-03-03 15:08:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14618 to 9152. [2025-03-03 15:08:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9152 states, 9150 states have (on average 1.4007650273224044) internal successors, (12817), 9151 states have internal predecessors, (12817), 0 states have call successors, (0), 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-03 15:08:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9152 states to 9152 states and 12817 transitions. [2025-03-03 15:08:52,025 INFO L78 Accepts]: Start accepts. Automaton has 9152 states and 12817 transitions. Word has length 72 [2025-03-03 15:08:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:52,025 INFO L471 AbstractCegarLoop]: Abstraction has 9152 states and 12817 transitions. [2025-03-03 15:08:52,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 15:08:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9152 states and 12817 transitions. [2025-03-03 15:08:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:52,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:52,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:52,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:52,029 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:52,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:52,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1809798070, now seen corresponding path program 1 times [2025-03-03 15:08:52,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:52,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957882895] [2025-03-03 15:08:52,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:52,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:52,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:52,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:52,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:52,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957882895] [2025-03-03 15:08:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957882895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:52,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:52,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288342102] [2025-03-03 15:08:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:52,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:52,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:52,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:52,072 INFO L87 Difference]: Start difference. First operand 9152 states and 12817 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:52,116 INFO L93 Difference]: Finished difference Result 14305 states and 20150 transitions. [2025-03-03 15:08:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:52,125 INFO L225 Difference]: With dead ends: 14305 [2025-03-03 15:08:52,126 INFO L226 Difference]: Without dead ends: 9156 [2025-03-03 15:08:52,130 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-03 15:08:52,131 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 238 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:52,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 973 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9156 states. [2025-03-03 15:08:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9156 to 9152. [2025-03-03 15:08:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9152 states, 9150 states have (on average 1.3879781420765027) internal successors, (12700), 9151 states have internal predecessors, (12700), 0 states have call successors, (0), 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-03 15:08:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9152 states to 9152 states and 12700 transitions. [2025-03-03 15:08:52,277 INFO L78 Accepts]: Start accepts. Automaton has 9152 states and 12700 transitions. Word has length 73 [2025-03-03 15:08:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:52,282 INFO L471 AbstractCegarLoop]: Abstraction has 9152 states and 12700 transitions. [2025-03-03 15:08:52,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9152 states and 12700 transitions. [2025-03-03 15:08:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:52,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:52,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:52,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:52,287 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 746288790, now seen corresponding path program 1 times [2025-03-03 15:08:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:52,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634053615] [2025-03-03 15:08:52,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:52,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:52,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:52,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634053615] [2025-03-03 15:08:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634053615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:52,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:52,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093006131] [2025-03-03 15:08:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:52,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:52,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:52,750 INFO L87 Difference]: Start difference. First operand 9152 states and 12700 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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-03 15:08:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:53,186 INFO L93 Difference]: Finished difference Result 15607 states and 21845 transitions. [2025-03-03 15:08:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:53,197 INFO L225 Difference]: With dead ends: 15607 [2025-03-03 15:08:53,197 INFO L226 Difference]: Without dead ends: 12942 [2025-03-03 15:08:53,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:08:53,202 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 2747 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:53,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2747 Valid, 2270 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12942 states. [2025-03-03 15:08:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12942 to 9049. [2025-03-03 15:08:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9049 states, 9048 states have (on average 1.3895888594164456) internal successors, (12573), 9048 states have internal predecessors, (12573), 0 states have call successors, (0), 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-03 15:08:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9049 states to 9049 states and 12573 transitions. [2025-03-03 15:08:53,311 INFO L78 Accepts]: Start accepts. Automaton has 9049 states and 12573 transitions. Word has length 75 [2025-03-03 15:08:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 9049 states and 12573 transitions. [2025-03-03 15:08:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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-03 15:08:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9049 states and 12573 transitions. [2025-03-03 15:08:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:08:53,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:53,318 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] [2025-03-03 15:08:53,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:53,319 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash -655044574, now seen corresponding path program 1 times [2025-03-03 15:08:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:53,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452289841] [2025-03-03 15:08:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:53,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:08:53,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:08:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452289841] [2025-03-03 15:08:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452289841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359172603] [2025-03-03 15:08:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:53,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:53,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:53,398 INFO L87 Difference]: Start difference. First operand 9049 states and 12573 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 15:08:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:53,530 INFO L93 Difference]: Finished difference Result 36368 states and 51827 transitions. [2025-03-03 15:08:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:08:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:53,558 INFO L225 Difference]: With dead ends: 36368 [2025-03-03 15:08:53,558 INFO L226 Difference]: Without dead ends: 28959 [2025-03-03 15:08:53,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:53,570 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 2083 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:53,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 1068 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28959 states. [2025-03-03 15:08:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28959 to 16456. [2025-03-03 15:08:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16456 states, 16455 states have (on average 1.3947128532360984) internal successors, (22950), 16455 states have internal predecessors, (22950), 0 states have call successors, (0), 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-03 15:08:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16456 states to 16456 states and 22950 transitions. [2025-03-03 15:08:53,846 INFO L78 Accepts]: Start accepts. Automaton has 16456 states and 22950 transitions. Word has length 84 [2025-03-03 15:08:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:53,846 INFO L471 AbstractCegarLoop]: Abstraction has 16456 states and 22950 transitions. [2025-03-03 15:08:53,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 15:08:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16456 states and 22950 transitions. [2025-03-03 15:08:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:08:53,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:53,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:53,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:53,857 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1198039173, now seen corresponding path program 1 times [2025-03-03 15:08:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:53,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785898973] [2025-03-03 15:08:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:08:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:08:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785898973] [2025-03-03 15:08:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785898973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:53,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:53,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556181225] [2025-03-03 15:08:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:53,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:53,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:53,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:53,960 INFO L87 Difference]: Start difference. First operand 16456 states and 22950 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 15:08:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:54,097 INFO L93 Difference]: Finished difference Result 25254 states and 35211 transitions. [2025-03-03 15:08:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:08:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:54,114 INFO L225 Difference]: With dead ends: 25254 [2025-03-03 15:08:54,114 INFO L226 Difference]: Without dead ends: 16262 [2025-03-03 15:08:54,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:54,125 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1232 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:54,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 1226 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16262 states. [2025-03-03 15:08:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16262 to 11884. [2025-03-03 15:08:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11883 states have (on average 1.3739796347723638) internal successors, (16327), 11883 states have internal predecessors, (16327), 0 states have call successors, (0), 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-03 15:08:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 16327 transitions. [2025-03-03 15:08:54,297 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 16327 transitions. Word has length 85 [2025-03-03 15:08:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:54,297 INFO L471 AbstractCegarLoop]: Abstraction has 11884 states and 16327 transitions. [2025-03-03 15:08:54,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 15:08:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 16327 transitions. [2025-03-03 15:08:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:08:54,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:54,305 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] [2025-03-03 15:08:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:54,305 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:54,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2134494609, now seen corresponding path program 1 times [2025-03-03 15:08:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:54,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624876884] [2025-03-03 15:08:54,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:54,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:08:54,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:08:54,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:54,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624876884] [2025-03-03 15:08:54,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624876884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:54,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665891608] [2025-03-03 15:08:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:54,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:54,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:54,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:54,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:54,433 INFO L87 Difference]: Start difference. First operand 11884 states and 16327 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 15:08:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:54,500 INFO L93 Difference]: Finished difference Result 32116 states and 44585 transitions. [2025-03-03 15:08:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:08:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:54,520 INFO L225 Difference]: With dead ends: 32116 [2025-03-03 15:08:54,520 INFO L226 Difference]: Without dead ends: 21680 [2025-03-03 15:08:54,531 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-03 15:08:54,531 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 142 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:54,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 850 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21680 states. [2025-03-03 15:08:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21680 to 20318. [2025-03-03 15:08:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20318 states, 20317 states have (on average 1.3738740955849782) internal successors, (27913), 20317 states have internal predecessors, (27913), 0 states have call successors, (0), 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-03 15:08:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20318 states to 20318 states and 27913 transitions. [2025-03-03 15:08:54,736 INFO L78 Accepts]: Start accepts. Automaton has 20318 states and 27913 transitions. Word has length 86 [2025-03-03 15:08:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 20318 states and 27913 transitions. [2025-03-03 15:08:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 15:08:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 20318 states and 27913 transitions. [2025-03-03 15:08:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:08:54,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:54,752 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] [2025-03-03 15:08:54,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:54,754 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1009104974, now seen corresponding path program 1 times [2025-03-03 15:08:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518741317] [2025-03-03 15:08:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:54,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:08:54,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:08:54,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:54,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518741317] [2025-03-03 15:08:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518741317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61857631] [2025-03-03 15:08:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:54,819 INFO L87 Difference]: Start difference. First operand 20318 states and 27913 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 15:08:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:54,930 INFO L93 Difference]: Finished difference Result 26588 states and 36560 transitions. [2025-03-03 15:08:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:08:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:54,945 INFO L225 Difference]: With dead ends: 26588 [2025-03-03 15:08:54,946 INFO L226 Difference]: Without dead ends: 14407 [2025-03-03 15:08:54,968 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-03 15:08:54,968 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 241 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:54,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 900 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2025-03-03 15:08:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 14405. [2025-03-03 15:08:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14405 states, 14404 states have (on average 1.364620938628159) internal successors, (19656), 14404 states have internal predecessors, (19656), 0 states have call successors, (0), 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-03 15:08:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14405 states to 14405 states and 19656 transitions. [2025-03-03 15:08:55,132 INFO L78 Accepts]: Start accepts. Automaton has 14405 states and 19656 transitions. Word has length 87 [2025-03-03 15:08:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:55,133 INFO L471 AbstractCegarLoop]: Abstraction has 14405 states and 19656 transitions. [2025-03-03 15:08:55,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 15:08:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14405 states and 19656 transitions. [2025-03-03 15:08:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:08:55,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:55,139 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] [2025-03-03 15:08:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:55,140 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:55,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash -257802829, now seen corresponding path program 1 times [2025-03-03 15:08:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562466794] [2025-03-03 15:08:55,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:55,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:08:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:08:55,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:55,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562466794] [2025-03-03 15:08:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562466794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222851228] [2025-03-03 15:08:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:55,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:55,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:55,260 INFO L87 Difference]: Start difference. First operand 14405 states and 19656 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 15:08:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:55,365 INFO L93 Difference]: Finished difference Result 39537 states and 54350 transitions. [2025-03-03 15:08:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:08:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:55,442 INFO L225 Difference]: With dead ends: 39537 [2025-03-03 15:08:55,442 INFO L226 Difference]: Without dead ends: 26511 [2025-03-03 15:08:55,456 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-03 15:08:55,456 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 129 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:55,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 832 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26511 states. [2025-03-03 15:08:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26511 to 24797. [2025-03-03 15:08:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24797 states, 24796 states have (on average 1.3648975641232457) internal successors, (33844), 24796 states have internal predecessors, (33844), 0 states have call successors, (0), 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-03 15:08:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24797 states to 24797 states and 33844 transitions. [2025-03-03 15:08:55,846 INFO L78 Accepts]: Start accepts. Automaton has 24797 states and 33844 transitions. Word has length 87 [2025-03-03 15:08:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 24797 states and 33844 transitions. [2025-03-03 15:08:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 15:08:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 24797 states and 33844 transitions. [2025-03-03 15:08:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:08:55,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:55,853 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] [2025-03-03 15:08:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:55,853 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1528579857, now seen corresponding path program 1 times [2025-03-03 15:08:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429026616] [2025-03-03 15:08:55,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:55,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:08:55,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:08:55,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:55,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:55,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:55,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429026616] [2025-03-03 15:08:55,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429026616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:55,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740830407] [2025-03-03 15:08:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:55,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:55,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:55,956 INFO L87 Difference]: Start difference. First operand 24797 states and 33844 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-03 15:08:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:56,128 INFO L93 Difference]: Finished difference Result 69793 states and 95518 transitions. [2025-03-03 15:08:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:08:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:56,178 INFO L225 Difference]: With dead ends: 69793 [2025-03-03 15:08:56,178 INFO L226 Difference]: Without dead ends: 46375 [2025-03-03 15:08:56,202 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-03 15:08:56,202 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:56,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 812 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46375 states. [2025-03-03 15:08:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46375 to 43557. [2025-03-03 15:08:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43557 states, 43556 states have (on average 1.3609146845440352) internal successors, (59276), 43556 states have internal predecessors, (59276), 0 states have call successors, (0), 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-03 15:08:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43557 states to 43557 states and 59276 transitions. [2025-03-03 15:08:56,665 INFO L78 Accepts]: Start accepts. Automaton has 43557 states and 59276 transitions. Word has length 89 [2025-03-03 15:08:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:56,665 INFO L471 AbstractCegarLoop]: Abstraction has 43557 states and 59276 transitions. [2025-03-03 15:08:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-03 15:08:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43557 states and 59276 transitions. [2025-03-03 15:08:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:08:56,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:56,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:56,670 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2109092762, now seen corresponding path program 1 times [2025-03-03 15:08:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085730898] [2025-03-03 15:08:56,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:08:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:08:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085730898] [2025-03-03 15:08:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085730898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137931132] [2025-03-03 15:08:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:56,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:56,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:56,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:56,790 INFO L87 Difference]: Start difference. First operand 43557 states and 59276 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:56,995 INFO L93 Difference]: Finished difference Result 123193 states and 167462 transitions. [2025-03-03 15:08:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:08:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:57,078 INFO L225 Difference]: With dead ends: 123193 [2025-03-03 15:08:57,078 INFO L226 Difference]: Without dead ends: 81015 [2025-03-03 15:08:57,116 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-03 15:08:57,116 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 342 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:57,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 585 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81015 states. [2025-03-03 15:08:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81015 to 79973. [2025-03-03 15:08:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79973 states, 79972 states have (on average 1.3339168709048166) internal successors, (106676), 79972 states have internal predecessors, (106676), 0 states have call successors, (0), 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-03 15:08:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79973 states to 79973 states and 106676 transitions. [2025-03-03 15:08:58,076 INFO L78 Accepts]: Start accepts. Automaton has 79973 states and 106676 transitions. Word has length 90 [2025-03-03 15:08:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 79973 states and 106676 transitions. [2025-03-03 15:08:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 79973 states and 106676 transitions. [2025-03-03 15:08:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:08:58,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:58,083 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] [2025-03-03 15:08:58,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:58,083 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:08:58,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2123834920, now seen corresponding path program 1 times [2025-03-03 15:08:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110395588] [2025-03-03 15:08:58,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:58,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:08:58,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:08:58,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:58,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110395588] [2025-03-03 15:08:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110395588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:58,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985800055] [2025-03-03 15:08:58,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:58,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:58,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:58,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:58,173 INFO L87 Difference]: Start difference. First operand 79973 states and 106676 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:58,746 INFO L93 Difference]: Finished difference Result 205817 states and 274958 transitions. [2025-03-03 15:08:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:08:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:58,908 INFO L225 Difference]: With dead ends: 205817 [2025-03-03 15:08:58,908 INFO L226 Difference]: Without dead ends: 127223 [2025-03-03 15:08:58,964 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-03 15:08:58,965 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 151 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:58,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 868 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127223 states. [2025-03-03 15:09:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127223 to 115957. [2025-03-03 15:09:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115957 states, 115956 states have (on average 1.3268826106454172) internal successors, (153860), 115956 states have internal predecessors, (153860), 0 states have call successors, (0), 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-03 15:09:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115957 states to 115957 states and 153860 transitions. [2025-03-03 15:09:00,721 INFO L78 Accepts]: Start accepts. Automaton has 115957 states and 153860 transitions. Word has length 90 [2025-03-03 15:09:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 115957 states and 153860 transitions. [2025-03-03 15:09:00,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 115957 states and 153860 transitions. [2025-03-03 15:09:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:09:00,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:00,725 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] [2025-03-03 15:09:00,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:09:00,725 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -835085174, now seen corresponding path program 1 times [2025-03-03 15:09:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856940586] [2025-03-03 15:09:00,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:00,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:09:00,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:09:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856940586] [2025-03-03 15:09:01,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856940586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065139434] [2025-03-03 15:09:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:01,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:09:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:09:01,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:09:01,086 INFO L87 Difference]: Start difference. First operand 115957 states and 153860 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-03 15:09:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:01,421 INFO L93 Difference]: Finished difference Result 120639 states and 160101 transitions. [2025-03-03 15:09:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:09:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:09:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:01,551 INFO L225 Difference]: With dead ends: 120639 [2025-03-03 15:09:01,551 INFO L226 Difference]: Without dead ends: 120637 [2025-03-03 15:09:01,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:09:01,572 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 0 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:01,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2075 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120637 states. [2025-03-03 15:09:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120637 to 120637. [2025-03-03 15:09:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120637 states, 120636 states have (on average 1.3012699360058357) internal successors, (156980), 120636 states have internal predecessors, (156980), 0 states have call successors, (0), 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-03 15:09:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120637 states to 120637 states and 156980 transitions. [2025-03-03 15:09:02,812 INFO L78 Accepts]: Start accepts. Automaton has 120637 states and 156980 transitions. Word has length 91 [2025-03-03 15:09:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:02,813 INFO L471 AbstractCegarLoop]: Abstraction has 120637 states and 156980 transitions. [2025-03-03 15:09:02,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-03 15:09:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 120637 states and 156980 transitions. [2025-03-03 15:09:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:09:02,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:02,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:02,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:09:02,818 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:02,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1259670590, now seen corresponding path program 1 times [2025-03-03 15:09:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144363418] [2025-03-03 15:09:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:02,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:09:02,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:09:02,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:02,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:02,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-03 15:09:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144363418] [2025-03-03 15:09:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144363418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:02,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703531578] [2025-03-03 15:09:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:02,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:09:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:02,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:09:02,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:09:02,942 INFO L87 Difference]: Start difference. First operand 120637 states and 156980 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-03 15:09:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:03,756 INFO L93 Difference]: Finished difference Result 188279 states and 246113 transitions. [2025-03-03 15:09:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:09:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 15:09:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:03,961 INFO L225 Difference]: With dead ends: 188279 [2025-03-03 15:09:03,961 INFO L226 Difference]: Without dead ends: 162033 [2025-03-03 15:09:04,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:04,011 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 1562 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:04,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 1289 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162033 states. [2025-03-03 15:09:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162033 to 138649. [2025-03-03 15:09:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138649 states, 138648 states have (on average 1.2988575385148) internal successors, (180084), 138648 states have internal predecessors, (180084), 0 states have call successors, (0), 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-03 15:09:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138649 states to 138649 states and 180084 transitions. [2025-03-03 15:09:05,752 INFO L78 Accepts]: Start accepts. Automaton has 138649 states and 180084 transitions. Word has length 93 [2025-03-03 15:09:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,753 INFO L471 AbstractCegarLoop]: Abstraction has 138649 states and 180084 transitions. [2025-03-03 15:09:05,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-03 15:09:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 138649 states and 180084 transitions. [2025-03-03 15:09:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:05,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:05,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:05,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:09:05,757 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1633379792, now seen corresponding path program 1 times [2025-03-03 15:09:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880949049] [2025-03-03 15:09:05,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:05,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:05,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:05,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:05,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:05,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880949049] [2025-03-03 15:09:05,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880949049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692403184] [2025-03-03 15:09:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:05,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:05,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:05,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:05,804 INFO L87 Difference]: Start difference. First operand 138649 states and 180084 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-03 15:09:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:06,596 INFO L93 Difference]: Finished difference Result 274853 states and 357054 transitions. [2025-03-03 15:09:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 15:09:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:06,839 INFO L225 Difference]: With dead ends: 274853 [2025-03-03 15:09:06,839 INFO L226 Difference]: Without dead ends: 195256 [2025-03-03 15:09:06,911 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-03 15:09:06,912 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 371 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:06,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 561 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195256 states. [2025-03-03 15:09:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195256 to 136293. [2025-03-03 15:09:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136293 states, 136292 states have (on average 1.2959968303348692) internal successors, (176634), 136292 states have internal predecessors, (176634), 0 states have call successors, (0), 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-03 15:09:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136293 states to 136293 states and 176634 transitions. [2025-03-03 15:09:09,111 INFO L78 Accepts]: Start accepts. Automaton has 136293 states and 176634 transitions. Word has length 94 [2025-03-03 15:09:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 136293 states and 176634 transitions. [2025-03-03 15:09:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-03 15:09:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 136293 states and 176634 transitions. [2025-03-03 15:09:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:09:09,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:09,114 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] [2025-03-03 15:09:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:09:09,114 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -624000496, now seen corresponding path program 1 times [2025-03-03 15:09:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519956980] [2025-03-03 15:09:09,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:09,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:09:09,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:09:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519956980] [2025-03-03 15:09:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519956980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578037356] [2025-03-03 15:09:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:09,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:09:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:09,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:09:09,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:09:09,203 INFO L87 Difference]: Start difference. First operand 136293 states and 176634 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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-03 15:09:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:09,657 INFO L93 Difference]: Finished difference Result 192979 states and 251111 transitions. [2025-03-03 15:09:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:09:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 15:09:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:09,870 INFO L225 Difference]: With dead ends: 192979 [2025-03-03 15:09:09,870 INFO L226 Difference]: Without dead ends: 167597 [2025-03-03 15:09:09,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:09,927 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1558 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:09,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1267 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167597 states. [2025-03-03 15:09:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167597 to 153825. [2025-03-03 15:09:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153825 states, 153824 states have (on average 1.2938033076763054) internal successors, (199018), 153824 states have internal predecessors, (199018), 0 states have call successors, (0), 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-03 15:09:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153825 states to 153825 states and 199018 transitions. [2025-03-03 15:09:11,890 INFO L78 Accepts]: Start accepts. Automaton has 153825 states and 199018 transitions. Word has length 95 [2025-03-03 15:09:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:11,890 INFO L471 AbstractCegarLoop]: Abstraction has 153825 states and 199018 transitions. [2025-03-03 15:09:11,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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-03 15:09:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 153825 states and 199018 transitions. [2025-03-03 15:09:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:09:11,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:11,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:11,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:09:11,914 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 986630576, now seen corresponding path program 1 times [2025-03-03 15:09:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343251541] [2025-03-03 15:09:11,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:11,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:09:11,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:09:11,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343251541] [2025-03-03 15:09:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343251541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:09:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778522295] [2025-03-03 15:09:12,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:09:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:12,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:09:12,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:09:12,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:09:12,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:09:12,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:12,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:12,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:09:12,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:09:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:13,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:09:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778522295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:09:14,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:09:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-03 15:09:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540784469] [2025-03-03 15:09:14,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:09:14,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:09:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:14,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:09:14,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:09:14,101 INFO L87 Difference]: Start difference. First operand 153825 states and 199018 transitions. Second operand has 26 states, 26 states have (on average 11.23076923076923) internal successors, (292), 25 states have internal predecessors, (292), 0 states have call successors, (0), 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-03 15:09:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:16,110 INFO L93 Difference]: Finished difference Result 413242 states and 535818 transitions. [2025-03-03 15:09:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:09:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.23076923076923) internal successors, (292), 25 states have internal predecessors, (292), 0 states have call successors, (0), 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-03 15:09:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:16,613 INFO L225 Difference]: With dead ends: 413242 [2025-03-03 15:09:16,613 INFO L226 Difference]: Without dead ends: 346424 [2025-03-03 15:09:16,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 15:09:16,682 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 3575 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3575 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:16,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3575 Valid, 2776 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:09:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346424 states. [2025-03-03 15:09:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346424 to 248765. [2025-03-03 15:09:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248765 states, 248764 states have (on average 1.2947773793635735) internal successors, (322094), 248764 states have internal predecessors, (322094), 0 states have call successors, (0), 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-03 15:09:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248765 states to 248765 states and 322094 transitions. [2025-03-03 15:09:20,098 INFO L78 Accepts]: Start accepts. Automaton has 248765 states and 322094 transitions. Word has length 116 [2025-03-03 15:09:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:20,098 INFO L471 AbstractCegarLoop]: Abstraction has 248765 states and 322094 transitions. [2025-03-03 15:09:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.23076923076923) internal successors, (292), 25 states have internal predecessors, (292), 0 states have call successors, (0), 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-03 15:09:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 248765 states and 322094 transitions. [2025-03-03 15:09:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:09:20,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:20,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:20,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:09:20,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-03 15:09:20,807 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:20,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1212894133, now seen corresponding path program 1 times [2025-03-03 15:09:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312692600] [2025-03-03 15:09:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:20,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:09:20,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:09:20,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:20,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:09:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312692600] [2025-03-03 15:09:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312692600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:21,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:21,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608510679] [2025-03-03 15:09:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:21,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:21,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:21,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:21,009 INFO L87 Difference]: Start difference. First operand 248765 states and 322094 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 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-03 15:09:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:23,024 INFO L93 Difference]: Finished difference Result 686571 states and 885941 transitions. [2025-03-03 15:09:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:09:23,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 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 116 [2025-03-03 15:09:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:23,958 INFO L225 Difference]: With dead ends: 686571 [2025-03-03 15:09:23,958 INFO L226 Difference]: Without dead ends: 571742 [2025-03-03 15:09:24,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:09:24,110 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1931 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:24,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 1223 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:09:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571742 states. [2025-03-03 15:09:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571742 to 248725. [2025-03-03 15:09:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248725 states, 248724 states have (on average 1.2947564368537012) internal successors, (322037), 248724 states have internal predecessors, (322037), 0 states have call successors, (0), 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-03 15:09:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248725 states to 248725 states and 322037 transitions. [2025-03-03 15:09:28,861 INFO L78 Accepts]: Start accepts. Automaton has 248725 states and 322037 transitions. Word has length 116 [2025-03-03 15:09:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:28,861 INFO L471 AbstractCegarLoop]: Abstraction has 248725 states and 322037 transitions. [2025-03-03 15:09:28,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 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-03 15:09:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 248725 states and 322037 transitions. [2025-03-03 15:09:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:09:29,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:29,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:29,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:09:29,399 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:09:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 213204997, now seen corresponding path program 1 times [2025-03-03 15:09:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870901537] [2025-03-03 15:09:29,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:09:29,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:09:29,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:29,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:09:29,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870901537] [2025-03-03 15:09:29,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870901537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:29,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713028034] [2025-03-03 15:09:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:29,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:29,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:29,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:29,578 INFO L87 Difference]: Start difference. First operand 248725 states and 322037 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 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)