./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:32:34,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:32:34,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:32:34,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:32:34,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:32:34,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:32:34,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:32:34,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:32:34,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:32:34,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:32:34,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:32:34,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:32:34,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:32:34,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:32:34,190 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:32:34,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:32:34,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:32:34,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:32:34,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:32:34,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:32:34,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:32:34,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:32:34,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:32:34,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:32:34,193 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-jdk21/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 -> 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe [2025-02-05 16:32:34,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:32:34,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:32:34,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:32:34,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:32:34,433 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:32:34,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:32:35,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf5e74ac/0e1e31f39459467d9148e1e41e0c3858/FLAG2e0064d2c [2025-02-05 16:32:35,942 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:32:35,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:32:35,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf5e74ac/0e1e31f39459467d9148e1e41e0c3858/FLAG2e0064d2c [2025-02-05 16:32:35,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcf5e74ac/0e1e31f39459467d9148e1e41e0c3858 [2025-02-05 16:32:35,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:32:35,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:32:35,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:32:35,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:32:35,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:32:35,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:32:35" (1/1) ... [2025-02-05 16:32:35,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20232f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:35, skipping insertion in model container [2025-02-05 16:32:35,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:32:35" (1/1) ... [2025-02-05 16:32:36,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:32:36,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2025-02-05 16:32:36,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2025-02-05 16:32:36,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2025-02-05 16:32:36,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2025-02-05 16:32:36,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:32:36,374 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:32:36,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2025-02-05 16:32:36,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2025-02-05 16:32:36,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2025-02-05 16:32:36,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2025-02-05 16:32:36,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:32:36,548 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:32:36,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36 WrapperNode [2025-02-05 16:32:36,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:32:36,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:32:36,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:32:36,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:32:36,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,628 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2844 [2025-02-05 16:32:36,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:32:36,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:32:36,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:32:36,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:32:36,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,661 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-02-05 16:32:36,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:32:36,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:32:36,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:32:36,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:32:36,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (1/1) ... [2025-02-05 16:32:36,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:32:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:36,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:32:36,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:32:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:32:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:32:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:32:36,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:32:36,864 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:32:36,865 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:32:38,114 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1621: havoc main_~node3__m3~6#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: havoc main_~node2__m2~1#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142: havoc main_~node3__m3~12#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3935: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2086: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2549: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3408: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3674: havoc main_~node3__m3~14#1; [2025-02-05 16:32:38,115 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2221: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4139: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4274: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2028: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2491: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L906: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L511: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:32:38,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3418: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3684: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4081: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3356: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2167: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node3__m3~1#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3888: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2025-02-05 16:32:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node2__m2~3#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3427: havoc main_~node3__m3~13#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4220: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4023: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L654: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node2__m2~2#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3298: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~node2__m2~4#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2640: havoc main_~node3__m3~10#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3830: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-02-05 16:32:38,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1719: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3437: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1588: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3969: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L798: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2384: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3772: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~check__tmp~9#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L998: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2650: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1131: havoc main_~node3__m3~4#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3047: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: havoc main_~node3__m3~5#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2123: havoc main_~node3__m3~8#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node3__m3~2#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2854: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L740: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-02-05 16:32:38,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node2__m2~0#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4176: havoc main_~node3__m3~16#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: havoc main_~node3__m3~9#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3186: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3583: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2989: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3718: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1472: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2133: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:32:38,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4186: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2337: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2935: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4390: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2607: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L956: havoc main_~node3__m3~3#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:32:38,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node3__m3~0#1; [2025-02-05 16:32:38,122 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:32:38,122 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L826: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:32:38,189 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2025-02-05 16:32:38,189 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:32:38,204 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:32:38,205 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:32:38,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:32:38 BoogieIcfgContainer [2025-02-05 16:32:38,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:32:38,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:32:38,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:32:38,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:32:38,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:32:35" (1/3) ... [2025-02-05 16:32:38,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cdf1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:32:38, skipping insertion in model container [2025-02-05 16:32:38,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:32:36" (2/3) ... [2025-02-05 16:32:38,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cdf1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:32:38, skipping insertion in model container [2025-02-05 16:32:38,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:32:38" (3/3) ... [2025-02-05 16:32:38,215 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:32:38,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:32:38,229 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 457 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-05 16:32:38,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:32:38,281 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;@7dc607b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:32:38,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-05 16:32:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:32:38,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:38,293 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] [2025-02-05 16:32:38,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:38,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 692156089, now seen corresponding path program 1 times [2025-02-05 16:32:38,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:38,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366881932] [2025-02-05 16:32:38,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:38,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:32:38,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:32:38,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:38,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366881932] [2025-02-05 16:32:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366881932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:38,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:38,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215257947] [2025-02-05 16:32:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:38,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:38,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:38,606 INFO L87 Difference]: Start difference. First operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 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 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:38,735 INFO L93 Difference]: Finished difference Result 713 states and 1249 transitions. [2025-02-05 16:32:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 16:32:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:38,746 INFO L225 Difference]: With dead ends: 713 [2025-02-05 16:32:38,746 INFO L226 Difference]: Without dead ends: 579 [2025-02-05 16:32:38,748 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-02-05 16:32:38,751 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 421 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:38,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1419 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-05 16:32:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 572. [2025-02-05 16:32:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 568 states have (on average 1.3433098591549295) internal successors, (763), 571 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 763 transitions. [2025-02-05 16:32:38,809 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 763 transitions. Word has length 51 [2025-02-05 16:32:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:38,810 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 763 transitions. [2025-02-05 16:32:38,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 763 transitions. [2025-02-05 16:32:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:32:38,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:38,814 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] [2025-02-05 16:32:38,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:32:38,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash 51738873, now seen corresponding path program 1 times [2025-02-05 16:32:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059801706] [2025-02-05 16:32:38,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:32:38,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:32:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059801706] [2025-02-05 16:32:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059801706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:39,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:39,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:32:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111297479] [2025-02-05 16:32:39,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:39,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:39,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:39,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:39,094 INFO L87 Difference]: Start difference. First operand 572 states and 763 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:39,387 INFO L93 Difference]: Finished difference Result 1151 states and 1592 transitions. [2025-02-05 16:32:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 16:32:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:39,390 INFO L225 Difference]: With dead ends: 1151 [2025-02-05 16:32:39,390 INFO L226 Difference]: Without dead ends: 696 [2025-02-05 16:32:39,391 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-02-05 16:32:39,392 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1743 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:39,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 391 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:32:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-05 16:32:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 690. [2025-02-05 16:32:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 686 states have (on average 1.3935860058309038) internal successors, (956), 689 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 956 transitions. [2025-02-05 16:32:39,421 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 956 transitions. Word has length 51 [2025-02-05 16:32:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:39,421 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 956 transitions. [2025-02-05 16:32:39,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 956 transitions. [2025-02-05 16:32:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:32:39,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:39,425 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] [2025-02-05 16:32:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:32:39,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2135862553, now seen corresponding path program 1 times [2025-02-05 16:32:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:39,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731405256] [2025-02-05 16:32:39,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:32:39,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:32:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:39,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731405256] [2025-02-05 16:32:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731405256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:39,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:39,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:32:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363243214] [2025-02-05 16:32:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:39,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:39,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:39,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:39,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:39,568 INFO L87 Difference]: Start difference. First operand 690 states and 956 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:39,861 INFO L93 Difference]: Finished difference Result 1385 states and 1953 transitions. [2025-02-05 16:32:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:39,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:32:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:39,865 INFO L225 Difference]: With dead ends: 1385 [2025-02-05 16:32:39,866 INFO L226 Difference]: Without dead ends: 845 [2025-02-05 16:32:39,868 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-02-05 16:32:39,869 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1518 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:39,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 359 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-02-05 16:32:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 836. [2025-02-05 16:32:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 832 states have (on average 1.3966346153846154) internal successors, (1162), 835 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1162 transitions. [2025-02-05 16:32:39,892 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1162 transitions. Word has length 52 [2025-02-05 16:32:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:39,892 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1162 transitions. [2025-02-05 16:32:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1162 transitions. [2025-02-05 16:32:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:32:39,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:39,893 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] [2025-02-05 16:32:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:32:39,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1355098429, now seen corresponding path program 1 times [2025-02-05 16:32:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:39,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231917087] [2025-02-05 16:32:39,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:32:39,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:32:39,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:39,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231917087] [2025-02-05 16:32:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231917087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:39,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751130785] [2025-02-05 16:32:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:39,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:39,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:39,974 INFO L87 Difference]: Start difference. First operand 836 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:40,006 INFO L93 Difference]: Finished difference Result 1666 states and 2342 transitions. [2025-02-05 16:32:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:32:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:40,012 INFO L225 Difference]: With dead ends: 1666 [2025-02-05 16:32:40,012 INFO L226 Difference]: Without dead ends: 1116 [2025-02-05 16:32:40,013 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-02-05 16:32:40,013 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 323 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:40,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 847 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-05 16:32:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1104. [2025-02-05 16:32:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1100 states have (on average 1.3627272727272728) internal successors, (1499), 1103 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1499 transitions. [2025-02-05 16:32:40,032 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1499 transitions. Word has length 52 [2025-02-05 16:32:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:40,033 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1499 transitions. [2025-02-05 16:32:40,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1499 transitions. [2025-02-05 16:32:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:32:40,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:40,034 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] [2025-02-05 16:32:40,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:32:40,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:40,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash 636112114, now seen corresponding path program 1 times [2025-02-05 16:32:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927598967] [2025-02-05 16:32:40,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:40,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:40,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:32:40,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:32:40,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927598967] [2025-02-05 16:32:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927598967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:32:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161797212] [2025-02-05 16:32:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:40,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:40,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:40,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:40,131 INFO L87 Difference]: Start difference. First operand 1104 states and 1499 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:40,363 INFO L93 Difference]: Finished difference Result 2686 states and 3741 transitions. [2025-02-05 16:32:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:32:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:40,368 INFO L225 Difference]: With dead ends: 2686 [2025-02-05 16:32:40,368 INFO L226 Difference]: Without dead ends: 1736 [2025-02-05 16:32:40,369 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-02-05 16:32:40,370 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1455 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:40,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 353 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:32:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-02-05 16:32:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1730. [2025-02-05 16:32:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1726 states have (on average 1.3870220162224798) internal successors, (2394), 1729 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2394 transitions. [2025-02-05 16:32:40,399 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2394 transitions. Word has length 53 [2025-02-05 16:32:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:40,399 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2394 transitions. [2025-02-05 16:32:40,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2394 transitions. [2025-02-05 16:32:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:32:40,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:40,401 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] [2025-02-05 16:32:40,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:32:40,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:40,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1789828269, now seen corresponding path program 1 times [2025-02-05 16:32:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488975873] [2025-02-05 16:32:40,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:40,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:32:40,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:32:40,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:40,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488975873] [2025-02-05 16:32:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488975873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948672451] [2025-02-05 16:32:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:40,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:40,470 INFO L87 Difference]: Start difference. First operand 1730 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:40,508 INFO L93 Difference]: Finished difference Result 3555 states and 4987 transitions. [2025-02-05 16:32:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:32:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:40,514 INFO L225 Difference]: With dead ends: 3555 [2025-02-05 16:32:40,514 INFO L226 Difference]: Without dead ends: 2316 [2025-02-05 16:32:40,516 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-02-05 16:32:40,516 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 243 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 707 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-02-05 16:32:40,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 707 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2025-02-05 16:32:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2301. [2025-02-05 16:32:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3147 transitions. [2025-02-05 16:32:40,553 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3147 transitions. Word has length 53 [2025-02-05 16:32:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 3147 transitions. [2025-02-05 16:32:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3147 transitions. [2025-02-05 16:32:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:32:40,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:40,555 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] [2025-02-05 16:32:40,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:32:40,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1729728805, now seen corresponding path program 1 times [2025-02-05 16:32:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571922847] [2025-02-05 16:32:40,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:40,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:32:40,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:32:40,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:40,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:40,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:40,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571922847] [2025-02-05 16:32:40,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571922847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:40,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:40,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373460946] [2025-02-05 16:32:40,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:40,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:32:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:40,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:32:40,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:40,706 INFO L87 Difference]: Start difference. First operand 2301 states and 3147 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:41,047 INFO L93 Difference]: Finished difference Result 4539 states and 6295 transitions. [2025-02-05 16:32:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:32:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:32:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:41,060 INFO L225 Difference]: With dead ends: 4539 [2025-02-05 16:32:41,060 INFO L226 Difference]: Without dead ends: 3497 [2025-02-05 16:32:41,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:32:41,063 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1704 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:41,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 583 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2025-02-05 16:32:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2315. [2025-02-05 16:32:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3165 transitions. [2025-02-05 16:32:41,117 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3165 transitions. Word has length 54 [2025-02-05 16:32:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:41,119 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3165 transitions. [2025-02-05 16:32:41,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3165 transitions. [2025-02-05 16:32:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:32:41,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:41,120 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] [2025-02-05 16:32:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:32:41,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:41,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1813061798, now seen corresponding path program 1 times [2025-02-05 16:32:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585568335] [2025-02-05 16:32:41,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:32:41,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:32:41,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:41,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585568335] [2025-02-05 16:32:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585568335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:41,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574111652] [2025-02-05 16:32:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:32:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:41,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:32:41,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:41,287 INFO L87 Difference]: Start difference. First operand 2315 states and 3165 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:41,700 INFO L93 Difference]: Finished difference Result 4999 states and 6959 transitions. [2025-02-05 16:32:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:32:41,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:32:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:41,711 INFO L225 Difference]: With dead ends: 4999 [2025-02-05 16:32:41,711 INFO L226 Difference]: Without dead ends: 4152 [2025-02-05 16:32:41,712 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-02-05 16:32:41,712 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1829 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:41,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 618 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2025-02-05 16:32:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 2337. [2025-02-05 16:32:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2333 states have (on average 1.36990998714102) internal successors, (3196), 2336 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3196 transitions. [2025-02-05 16:32:41,782 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3196 transitions. Word has length 54 [2025-02-05 16:32:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:41,783 INFO L471 AbstractCegarLoop]: Abstraction has 2337 states and 3196 transitions. [2025-02-05 16:32:41,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3196 transitions. [2025-02-05 16:32:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:32:41,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:41,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:41,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:32:41,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:41,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 467795619, now seen corresponding path program 1 times [2025-02-05 16:32:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787369903] [2025-02-05 16:32:41,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:32:41,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:32:41,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787369903] [2025-02-05 16:32:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787369903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:41,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:41,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605573522] [2025-02-05 16:32:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:41,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:32:41,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:41,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:32:41,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:41,897 INFO L87 Difference]: Start difference. First operand 2337 states and 3196 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:42,249 INFO L93 Difference]: Finished difference Result 5833 states and 8113 transitions. [2025-02-05 16:32:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:32:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:32:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:42,263 INFO L225 Difference]: With dead ends: 5833 [2025-02-05 16:32:42,263 INFO L226 Difference]: Without dead ends: 4865 [2025-02-05 16:32:42,265 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-02-05 16:32:42,268 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1951 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:42,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 632 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2025-02-05 16:32:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 2371. [2025-02-05 16:32:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2367 states have (on average 1.3688212927756653) internal successors, (3240), 2370 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3240 transitions. [2025-02-05 16:32:42,339 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3240 transitions. Word has length 54 [2025-02-05 16:32:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3240 transitions. [2025-02-05 16:32:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3240 transitions. [2025-02-05 16:32:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:32:42,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:42,341 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] [2025-02-05 16:32:42,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:32:42,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1402362578, now seen corresponding path program 1 times [2025-02-05 16:32:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276835853] [2025-02-05 16:32:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:42,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:32:42,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:32:42,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:42,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:42,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276835853] [2025-02-05 16:32:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276835853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:42,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:42,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:32:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402576637] [2025-02-05 16:32:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:42,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:32:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:42,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:32:42,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:32:42,552 INFO L87 Difference]: Start difference. First operand 2371 states and 3240 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:43,106 INFO L93 Difference]: Finished difference Result 5585 states and 7820 transitions. [2025-02-05 16:32:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:32:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:32:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:43,115 INFO L225 Difference]: With dead ends: 5585 [2025-02-05 16:32:43,115 INFO L226 Difference]: Without dead ends: 4041 [2025-02-05 16:32:43,118 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-02-05 16:32:43,118 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1374 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:43,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 965 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2025-02-05 16:32:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2284. [2025-02-05 16:32:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2280 states have (on average 1.3675438596491227) internal successors, (3118), 2283 states have internal predecessors, (3118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3118 transitions. [2025-02-05 16:32:43,164 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3118 transitions. Word has length 55 [2025-02-05 16:32:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:43,164 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 3118 transitions. [2025-02-05 16:32:43,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3118 transitions. [2025-02-05 16:32:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:32:43,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:43,166 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] [2025-02-05 16:32:43,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:32:43,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:43,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 496768009, now seen corresponding path program 1 times [2025-02-05 16:32:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551549283] [2025-02-05 16:32:43,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:43,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:32:43,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:32:43,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:43,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551549283] [2025-02-05 16:32:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551549283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106970981] [2025-02-05 16:32:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:43,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:43,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:43,366 INFO L87 Difference]: Start difference. First operand 2284 states and 3118 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:43,946 INFO L93 Difference]: Finished difference Result 4905 states and 6809 transitions. [2025-02-05 16:32:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:32:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:32:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:43,960 INFO L225 Difference]: With dead ends: 4905 [2025-02-05 16:32:43,960 INFO L226 Difference]: Without dead ends: 3515 [2025-02-05 16:32:43,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:32:43,962 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1757 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:43,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1261 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:32:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2025-02-05 16:32:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2255. [2025-02-05 16:32:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2251 states have (on average 1.3669480231008442) internal successors, (3077), 2254 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3077 transitions. [2025-02-05 16:32:43,993 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3077 transitions. Word has length 55 [2025-02-05 16:32:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:43,993 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3077 transitions. [2025-02-05 16:32:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3077 transitions. [2025-02-05 16:32:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:32:43,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:43,997 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] [2025-02-05 16:32:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:32:43,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 761945362, now seen corresponding path program 1 times [2025-02-05 16:32:43,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:43,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584105124] [2025-02-05 16:32:43,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:43,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:44,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:32:44,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:32:44,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:44,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:44,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584105124] [2025-02-05 16:32:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584105124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:44,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:44,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104253941] [2025-02-05 16:32:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:44,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:44,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:44,210 INFO L87 Difference]: Start difference. First operand 2255 states and 3077 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:44,737 INFO L93 Difference]: Finished difference Result 3349 states and 4593 transitions. [2025-02-05 16:32:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:32:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:32:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:44,742 INFO L225 Difference]: With dead ends: 3349 [2025-02-05 16:32:44,742 INFO L226 Difference]: Without dead ends: 3344 [2025-02-05 16:32:44,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:32:44,743 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1735 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:44,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 1276 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2025-02-05 16:32:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 2255. [2025-02-05 16:32:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2251 states have (on average 1.3660595290981785) internal successors, (3075), 2254 states have internal predecessors, (3075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3075 transitions. [2025-02-05 16:32:44,769 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3075 transitions. Word has length 55 [2025-02-05 16:32:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:44,770 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3075 transitions. [2025-02-05 16:32:44,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3075 transitions. [2025-02-05 16:32:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:32:44,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:44,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:32:44,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 930432667, now seen corresponding path program 1 times [2025-02-05 16:32:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841839909] [2025-02-05 16:32:44,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:44,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:32:44,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:32:44,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:44,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841839909] [2025-02-05 16:32:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841839909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074876990] [2025-02-05 16:32:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:44,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:44,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:44,815 INFO L87 Difference]: Start difference. First operand 2255 states and 3075 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:44,837 INFO L93 Difference]: Finished difference Result 3345 states and 4593 transitions. [2025-02-05 16:32:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:32:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:44,840 INFO L225 Difference]: With dead ends: 3345 [2025-02-05 16:32:44,840 INFO L226 Difference]: Without dead ends: 2246 [2025-02-05 16:32:44,841 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-02-05 16:32:44,842 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 257 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 811 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-02-05 16:32:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2240. [2025-02-05 16:32:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2236 states have (on average 1.3466010733452594) internal successors, (3011), 2239 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3011 transitions. [2025-02-05 16:32:44,861 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3011 transitions. Word has length 56 [2025-02-05 16:32:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:44,861 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3011 transitions. [2025-02-05 16:32:44,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3011 transitions. [2025-02-05 16:32:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:32:44,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:44,863 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] [2025-02-05 16:32:44,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:32:44,863 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:44,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash 125999415, now seen corresponding path program 1 times [2025-02-05 16:32:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770325653] [2025-02-05 16:32:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:32:44,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:32:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770325653] [2025-02-05 16:32:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770325653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:44,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633438173] [2025-02-05 16:32:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:44,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:44,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:44,908 INFO L87 Difference]: Start difference. First operand 2240 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:44,929 INFO L93 Difference]: Finished difference Result 3237 states and 4391 transitions. [2025-02-05 16:32:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:32:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:44,932 INFO L225 Difference]: With dead ends: 3237 [2025-02-05 16:32:44,932 INFO L226 Difference]: Without dead ends: 2246 [2025-02-05 16:32:44,933 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-02-05 16:32:44,933 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 238 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 805 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-02-05 16:32:44,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 805 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-02-05 16:32:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2240. [2025-02-05 16:32:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2236 states have (on average 1.3340787119856887) internal successors, (2983), 2239 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2983 transitions. [2025-02-05 16:32:44,977 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2983 transitions. Word has length 56 [2025-02-05 16:32:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:44,978 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 2983 transitions. [2025-02-05 16:32:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2983 transitions. [2025-02-05 16:32:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:32:44,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:44,979 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] [2025-02-05 16:32:44,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:32:44,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2108801605, now seen corresponding path program 1 times [2025-02-05 16:32:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896231739] [2025-02-05 16:32:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:44,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:32:44,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:32:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896231739] [2025-02-05 16:32:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896231739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:45,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:45,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569938953] [2025-02-05 16:32:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:45,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:45,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:45,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:45,022 INFO L87 Difference]: Start difference. First operand 2240 states and 2983 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:45,052 INFO L93 Difference]: Finished difference Result 3170 states and 4260 transitions. [2025-02-05 16:32:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:32:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:45,055 INFO L225 Difference]: With dead ends: 3170 [2025-02-05 16:32:45,056 INFO L226 Difference]: Without dead ends: 2247 [2025-02-05 16:32:45,056 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-02-05 16:32:45,057 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 222 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 803 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2025-02-05 16:32:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2240. [2025-02-05 16:32:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2236 states have (on average 1.3206618962432917) internal successors, (2953), 2239 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2953 transitions. [2025-02-05 16:32:45,075 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2953 transitions. Word has length 56 [2025-02-05 16:32:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 2953 transitions. [2025-02-05 16:32:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2953 transitions. [2025-02-05 16:32:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:32:45,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:45,077 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] [2025-02-05 16:32:45,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:32:45,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:45,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 369426516, now seen corresponding path program 1 times [2025-02-05 16:32:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413003168] [2025-02-05 16:32:45,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:45,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:32:45,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:32:45,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:45,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413003168] [2025-02-05 16:32:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413003168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:45,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837420366] [2025-02-05 16:32:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:45,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:45,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:45,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:45,110 INFO L87 Difference]: Start difference. First operand 2240 states and 2953 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:45,155 INFO L93 Difference]: Finished difference Result 4004 states and 5341 transitions. [2025-02-05 16:32:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 16:32:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:45,159 INFO L225 Difference]: With dead ends: 4004 [2025-02-05 16:32:45,159 INFO L226 Difference]: Without dead ends: 2744 [2025-02-05 16:32:45,160 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-02-05 16:32:45,161 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 346 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:45,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 549 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2025-02-05 16:32:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2058. [2025-02-05 16:32:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2054 states have (on average 1.3227848101265822) internal successors, (2717), 2057 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2717 transitions. [2025-02-05 16:32:45,179 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2717 transitions. Word has length 57 [2025-02-05 16:32:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:45,179 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 2717 transitions. [2025-02-05 16:32:45,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2717 transitions. [2025-02-05 16:32:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:32:45,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:45,181 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] [2025-02-05 16:32:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:32:45,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 522032144, now seen corresponding path program 1 times [2025-02-05 16:32:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089885215] [2025-02-05 16:32:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:45,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:32:45,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:32:45,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:45,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089885215] [2025-02-05 16:32:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089885215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:45,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535183020] [2025-02-05 16:32:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:45,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:45,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:45,217 INFO L87 Difference]: Start difference. First operand 2058 states and 2717 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:45,272 INFO L93 Difference]: Finished difference Result 3728 states and 4964 transitions. [2025-02-05 16:32:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:32:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:45,275 INFO L225 Difference]: With dead ends: 3728 [2025-02-05 16:32:45,275 INFO L226 Difference]: Without dead ends: 2484 [2025-02-05 16:32:45,276 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-02-05 16:32:45,276 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 298 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:45,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 455 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-02-05 16:32:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1936. [2025-02-05 16:32:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1932 states have (on average 1.3255693581780539) internal successors, (2561), 1935 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2561 transitions. [2025-02-05 16:32:45,292 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2561 transitions. Word has length 58 [2025-02-05 16:32:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2561 transitions. [2025-02-05 16:32:45,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2561 transitions. [2025-02-05 16:32:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:32:45,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:45,294 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] [2025-02-05 16:32:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:32:45,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1877891216, now seen corresponding path program 1 times [2025-02-05 16:32:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:45,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380784190] [2025-02-05 16:32:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:45,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:32:45,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:32:45,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:45,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:45,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-02-05 16:32:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380784190] [2025-02-05 16:32:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380784190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:32:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505150844] [2025-02-05 16:32:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:45,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:32:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:45,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:32:45,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:32:45,786 INFO L87 Difference]: Start difference. First operand 1936 states and 2561 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:46,199 INFO L93 Difference]: Finished difference Result 2749 states and 3665 transitions. [2025-02-05 16:32:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:32:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:32:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:46,204 INFO L225 Difference]: With dead ends: 2749 [2025-02-05 16:32:46,204 INFO L226 Difference]: Without dead ends: 2688 [2025-02-05 16:32:46,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:32:46,206 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 914 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:46,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1845 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:32:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-02-05 16:32:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 1924. [2025-02-05 16:32:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1921 states have (on average 1.3258719416970328) internal successors, (2547), 1923 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2547 transitions. [2025-02-05 16:32:46,228 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2547 transitions. Word has length 58 [2025-02-05 16:32:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2547 transitions. [2025-02-05 16:32:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2547 transitions. [2025-02-05 16:32:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:32:46,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:46,254 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] [2025-02-05 16:32:46,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:32:46,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:46,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1818422423, now seen corresponding path program 1 times [2025-02-05 16:32:46,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:46,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031800691] [2025-02-05 16:32:46,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:46,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:32:46,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:32:46,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:46,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031800691] [2025-02-05 16:32:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031800691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:32:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606550347] [2025-02-05 16:32:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:32:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:46,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:32:46,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:46,993 INFO L87 Difference]: Start difference. First operand 1924 states and 2547 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:48,562 INFO L93 Difference]: Finished difference Result 3356 states and 4477 transitions. [2025-02-05 16:32:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:32:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:32:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:48,567 INFO L225 Difference]: With dead ends: 3356 [2025-02-05 16:32:48,567 INFO L226 Difference]: Without dead ends: 3352 [2025-02-05 16:32:48,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:32:48,568 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1711 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 3750 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:48,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 3750 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:32:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2025-02-05 16:32:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 1931. [2025-02-05 16:32:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1928 states have (on average 1.3257261410788381) internal successors, (2556), 1930 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2556 transitions. [2025-02-05 16:32:48,585 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2556 transitions. Word has length 58 [2025-02-05 16:32:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2556 transitions. [2025-02-05 16:32:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2556 transitions. [2025-02-05 16:32:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:32:48,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:48,586 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] [2025-02-05 16:32:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:32:48,586 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1984154437, now seen corresponding path program 1 times [2025-02-05 16:32:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360157373] [2025-02-05 16:32:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:48,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:32:48,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:32:48,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:48,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360157373] [2025-02-05 16:32:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360157373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:32:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320807174] [2025-02-05 16:32:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:49,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:32:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:49,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:32:49,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:32:49,065 INFO L87 Difference]: Start difference. First operand 1931 states and 2556 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:49,906 INFO L93 Difference]: Finished difference Result 4547 states and 6130 transitions. [2025-02-05 16:32:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:32:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:32:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:49,913 INFO L225 Difference]: With dead ends: 4547 [2025-02-05 16:32:49,913 INFO L226 Difference]: Without dead ends: 4543 [2025-02-05 16:32:49,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:32:49,916 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2777 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:49,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2777 Valid, 2457 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-02-05 16:32:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 1927. [2025-02-05 16:32:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1925 states have (on average 1.3257142857142856) internal successors, (2552), 1926 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2552 transitions. [2025-02-05 16:32:49,955 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2552 transitions. Word has length 58 [2025-02-05 16:32:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:49,955 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2552 transitions. [2025-02-05 16:32:49,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2552 transitions. [2025-02-05 16:32:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:32:49,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:49,957 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] [2025-02-05 16:32:49,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:32:49,957 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:49,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 750938128, now seen corresponding path program 1 times [2025-02-05 16:32:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172627701] [2025-02-05 16:32:49,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:32:49,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:32:49,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172627701] [2025-02-05 16:32:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172627701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693611257] [2025-02-05 16:32:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:49,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:49,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:49,998 INFO L87 Difference]: Start difference. First operand 1927 states and 2552 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:50,037 INFO L93 Difference]: Finished difference Result 3488 states and 4663 transitions. [2025-02-05 16:32:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:32:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:50,040 INFO L225 Difference]: With dead ends: 3488 [2025-02-05 16:32:50,040 INFO L226 Difference]: Without dead ends: 2317 [2025-02-05 16:32:50,041 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-02-05 16:32:50,041 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 254 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:50,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 443 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-02-05 16:32:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1847. [2025-02-05 16:32:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1845 states have (on average 1.3252032520325203) internal successors, (2445), 1846 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2445 transitions. [2025-02-05 16:32:50,054 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2445 transitions. Word has length 58 [2025-02-05 16:32:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2445 transitions. [2025-02-05 16:32:50,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2445 transitions. [2025-02-05 16:32:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:32:50,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:50,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:32:50,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash 457184881, now seen corresponding path program 1 times [2025-02-05 16:32:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143335228] [2025-02-05 16:32:50,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:50,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:32:50,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:32:50,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:50,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143335228] [2025-02-05 16:32:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143335228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:32:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601361485] [2025-02-05 16:32:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:32:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:50,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:32:50,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:32:50,583 INFO L87 Difference]: Start difference. First operand 1847 states and 2445 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:50,965 INFO L93 Difference]: Finished difference Result 2644 states and 3539 transitions. [2025-02-05 16:32:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:32:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 16:32:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:50,973 INFO L225 Difference]: With dead ends: 2644 [2025-02-05 16:32:50,973 INFO L226 Difference]: Without dead ends: 2640 [2025-02-05 16:32:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:32:50,975 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1065 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:50,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 1514 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:32:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-02-05 16:32:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 1836. [2025-02-05 16:32:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1835 states have (on average 1.325340599455041) internal successors, (2432), 1835 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2432 transitions. [2025-02-05 16:32:50,994 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2432 transitions. Word has length 59 [2025-02-05 16:32:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2432 transitions. [2025-02-05 16:32:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2432 transitions. [2025-02-05 16:32:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:32:50,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,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, 1, 1] [2025-02-05 16:32:51,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:32:51,000 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash 994384137, now seen corresponding path program 1 times [2025-02-05 16:32:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079394118] [2025-02-05 16:32:51,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:32:51,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:32:51,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079394118] [2025-02-05 16:32:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079394118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727976073] [2025-02-05 16:32:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:51,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:51,064 INFO L87 Difference]: Start difference. First operand 1836 states and 2432 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-02-05 16:32:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:51,120 INFO L93 Difference]: Finished difference Result 4249 states and 5787 transitions. [2025-02-05 16:32:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:51,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-02-05 16:32:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:51,124 INFO L225 Difference]: With dead ends: 4249 [2025-02-05 16:32:51,124 INFO L226 Difference]: Without dead ends: 3167 [2025-02-05 16:32:51,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-05 16:32:51,126 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 934 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:51,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 803 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2025-02-05 16:32:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 2755. [2025-02-05 16:32:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2754 states have (on average 1.3264342774146696) internal successors, (3653), 2754 states have internal predecessors, (3653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3653 transitions. [2025-02-05 16:32:51,143 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3653 transitions. Word has length 68 [2025-02-05 16:32:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:51,144 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3653 transitions. [2025-02-05 16:32:51,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-02-05 16:32:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3653 transitions. [2025-02-05 16:32:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:32:51,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,147 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-02-05 16:32:51,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:32:51,148 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 790723175, now seen corresponding path program 1 times [2025-02-05 16:32:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654253711] [2025-02-05 16:32:51,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:32:51,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:32:51,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654253711] [2025-02-05 16:32:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654253711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898785348] [2025-02-05 16:32:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:51,217 INFO L87 Difference]: Start difference. First operand 2755 states and 3653 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-02-05 16:32:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:51,273 INFO L93 Difference]: Finished difference Result 2761 states and 3656 transitions. [2025-02-05 16:32:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-02-05 16:32:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:51,277 INFO L225 Difference]: With dead ends: 2761 [2025-02-05 16:32:51,277 INFO L226 Difference]: Without dead ends: 2310 [2025-02-05 16:32:51,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:51,279 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 575 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:51,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2025-02-05 16:32:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2306. [2025-02-05 16:32:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.3310195227765727) internal successors, (3068), 2305 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3068 transitions. [2025-02-05 16:32:51,295 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3068 transitions. Word has length 69 [2025-02-05 16:32:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:51,295 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3068 transitions. [2025-02-05 16:32:51,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-02-05 16:32:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3068 transitions. [2025-02-05 16:32:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:32:51,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,297 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-02-05 16:32:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:32:51,297 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1632978968, now seen corresponding path program 1 times [2025-02-05 16:32:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876135268] [2025-02-05 16:32:51,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:32:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:32:51,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876135268] [2025-02-05 16:32:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876135268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950370621] [2025-02-05 16:32:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:51,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:51,369 INFO L87 Difference]: Start difference. First operand 2306 states and 3068 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-02-05 16:32:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:51,397 INFO L93 Difference]: Finished difference Result 5346 states and 7220 transitions. [2025-02-05 16:32:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:51,397 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-02-05 16:32:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:51,403 INFO L225 Difference]: With dead ends: 5346 [2025-02-05 16:32:51,403 INFO L226 Difference]: Without dead ends: 3638 [2025-02-05 16:32:51,405 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-02-05 16:32:51,406 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 155 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:51,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 539 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2025-02-05 16:32:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3428. [2025-02-05 16:32:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 3427 states have (on average 1.3271082579515612) internal successors, (4548), 3427 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 4548 transitions. [2025-02-05 16:32:51,458 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 4548 transitions. Word has length 70 [2025-02-05 16:32:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 3428 states and 4548 transitions. [2025-02-05 16:32:51,458 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-02-05 16:32:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 4548 transitions. [2025-02-05 16:32:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:32:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,460 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-02-05 16:32:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:32:51,461 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 106887474, now seen corresponding path program 1 times [2025-02-05 16:32:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912418861] [2025-02-05 16:32:51,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:32:51,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:32:51,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912418861] [2025-02-05 16:32:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912418861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527976174] [2025-02-05 16:32:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:51,518 INFO L87 Difference]: Start difference. First operand 3428 states and 4548 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-02-05 16:32:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:51,548 INFO L93 Difference]: Finished difference Result 8760 states and 11786 transitions. [2025-02-05 16:32:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:51,548 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-02-05 16:32:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:51,555 INFO L225 Difference]: With dead ends: 8760 [2025-02-05 16:32:51,555 INFO L226 Difference]: Without dead ends: 5954 [2025-02-05 16:32:51,557 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-02-05 16:32:51,558 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 135 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:51,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 535 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2025-02-05 16:32:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 5536. [2025-02-05 16:32:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5536 states, 5535 states have (on average 1.330442637759711) internal successors, (7364), 5535 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5536 states to 5536 states and 7364 transitions. [2025-02-05 16:32:51,595 INFO L78 Accepts]: Start accepts. Automaton has 5536 states and 7364 transitions. Word has length 71 [2025-02-05 16:32:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 5536 states and 7364 transitions. [2025-02-05 16:32:51,596 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-02-05 16:32:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5536 states and 7364 transitions. [2025-02-05 16:32:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:32:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,597 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-02-05 16:32:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:32:51,598 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 643974055, now seen corresponding path program 1 times [2025-02-05 16:32:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624568753] [2025-02-05 16:32:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:32:51,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:32:51,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624568753] [2025-02-05 16:32:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624568753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522256373] [2025-02-05 16:32:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:51,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:51,654 INFO L87 Difference]: Start difference. First operand 5536 states and 7364 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-02-05 16:32:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:51,700 INFO L93 Difference]: Finished difference Result 14804 states and 19806 transitions. [2025-02-05 16:32:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:51,700 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-02-05 16:32:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:51,713 INFO L225 Difference]: With dead ends: 14804 [2025-02-05 16:32:51,713 INFO L226 Difference]: Without dead ends: 9890 [2025-02-05 16:32:51,718 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-02-05 16:32:51,718 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 104 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:51,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 537 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9890 states. [2025-02-05 16:32:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9890 to 9056. [2025-02-05 16:32:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9056 states, 9055 states have (on average 1.3230259525124242) internal successors, (11980), 9055 states have internal predecessors, (11980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 11980 transitions. [2025-02-05 16:32:51,791 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 11980 transitions. Word has length 73 [2025-02-05 16:32:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:51,792 INFO L471 AbstractCegarLoop]: Abstraction has 9056 states and 11980 transitions. [2025-02-05 16:32:51,792 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-02-05 16:32:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 11980 transitions. [2025-02-05 16:32:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:32:51,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:51,793 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-02-05 16:32:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:32:51,794 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1143784379, now seen corresponding path program 1 times [2025-02-05 16:32:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336955724] [2025-02-05 16:32:51,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:51,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:32:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:32:51,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:51,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336955724] [2025-02-05 16:32:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336955724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:32:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240245464] [2025-02-05 16:32:51,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:51,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:32:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:51,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:32:51,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:32:51,974 INFO L87 Difference]: Start difference. First operand 9056 states and 11980 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:32:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:52,016 INFO L93 Difference]: Finished difference Result 9970 states and 13197 transitions. [2025-02-05 16:32:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:32:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:32:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:52,028 INFO L225 Difference]: With dead ends: 9970 [2025-02-05 16:32:52,028 INFO L226 Difference]: Without dead ends: 9968 [2025-02-05 16:32:52,030 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-02-05 16:32:52,031 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:52,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1335 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2025-02-05 16:32:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2025-02-05 16:32:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.2934684458713754) internal successors, (12892), 9967 states have internal predecessors, (12892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 12892 transitions. [2025-02-05 16:32:52,108 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 12892 transitions. Word has length 75 [2025-02-05 16:32:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:52,108 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 12892 transitions. [2025-02-05 16:32:52,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:32:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 12892 transitions. [2025-02-05 16:32:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:32:52,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:52,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:52,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:32:52,110 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -949780693, now seen corresponding path program 1 times [2025-02-05 16:32:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667901120] [2025-02-05 16:32:52,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:52,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:32:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:32:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667901120] [2025-02-05 16:32:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667901120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846648438] [2025-02-05 16:32:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:52,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:52,151 INFO L87 Difference]: Start difference. First operand 9968 states and 12892 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:52,204 INFO L93 Difference]: Finished difference Result 24048 states and 31090 transitions. [2025-02-05 16:32:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:32:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:52,227 INFO L225 Difference]: With dead ends: 24048 [2025-02-05 16:32:52,228 INFO L226 Difference]: Without dead ends: 14702 [2025-02-05 16:32:52,240 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-02-05 16:32:52,241 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 169 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:52,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 445 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14702 states. [2025-02-05 16:32:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14702 to 14700. [2025-02-05 16:32:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14700 states, 14699 states have (on average 1.276277297775359) internal successors, (18760), 14699 states have internal predecessors, (18760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14700 states to 14700 states and 18760 transitions. [2025-02-05 16:32:52,482 INFO L78 Accepts]: Start accepts. Automaton has 14700 states and 18760 transitions. Word has length 76 [2025-02-05 16:32:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:52,483 INFO L471 AbstractCegarLoop]: Abstraction has 14700 states and 18760 transitions. [2025-02-05 16:32:52,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14700 states and 18760 transitions. [2025-02-05 16:32:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:32:52,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:52,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:52,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:32:52,486 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2095661317, now seen corresponding path program 1 times [2025-02-05 16:32:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254102190] [2025-02-05 16:32:52,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:52,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:32:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:32:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254102190] [2025-02-05 16:32:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254102190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:52,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:52,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:52,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649266728] [2025-02-05 16:32:52,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:52,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:52,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:52,588 INFO L87 Difference]: Start difference. First operand 14700 states and 18760 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:52,694 INFO L93 Difference]: Finished difference Result 21416 states and 27493 transitions. [2025-02-05 16:32:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:32:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:52,720 INFO L225 Difference]: With dead ends: 21416 [2025-02-05 16:32:52,720 INFO L226 Difference]: Without dead ends: 17868 [2025-02-05 16:32:52,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:52,728 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 603 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:52,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 900 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17868 states. [2025-02-05 16:32:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17868 to 16634. [2025-02-05 16:32:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16634 states, 16633 states have (on average 1.2725305116334997) internal successors, (21166), 16633 states have internal predecessors, (21166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16634 states to 16634 states and 21166 transitions. [2025-02-05 16:32:52,886 INFO L78 Accepts]: Start accepts. Automaton has 16634 states and 21166 transitions. Word has length 77 [2025-02-05 16:32:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:52,887 INFO L471 AbstractCegarLoop]: Abstraction has 16634 states and 21166 transitions. [2025-02-05 16:32:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16634 states and 21166 transitions. [2025-02-05 16:32:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:32:52,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:52,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:52,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:32:52,889 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash -815618320, now seen corresponding path program 1 times [2025-02-05 16:32:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228158456] [2025-02-05 16:32:52,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:32:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:32:52,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228158456] [2025-02-05 16:32:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228158456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742713980] [2025-02-05 16:32:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:52,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:52,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:52,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:52,981 INFO L87 Difference]: Start difference. First operand 16634 states and 21166 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:53,069 INFO L93 Difference]: Finished difference Result 22532 states and 28841 transitions. [2025-02-05 16:32:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:32:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:53,101 INFO L225 Difference]: With dead ends: 22532 [2025-02-05 16:32:53,102 INFO L226 Difference]: Without dead ends: 18984 [2025-02-05 16:32:53,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:53,111 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 610 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:53,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 894 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2025-02-05 16:32:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 18558. [2025-02-05 16:32:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18558 states, 18557 states have (on average 1.2696556555477718) internal successors, (23561), 18557 states have internal predecessors, (23561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18558 states to 18558 states and 23561 transitions. [2025-02-05 16:32:53,375 INFO L78 Accepts]: Start accepts. Automaton has 18558 states and 23561 transitions. Word has length 79 [2025-02-05 16:32:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:53,375 INFO L471 AbstractCegarLoop]: Abstraction has 18558 states and 23561 transitions. [2025-02-05 16:32:53,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 18558 states and 23561 transitions. [2025-02-05 16:32:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:32:53,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:53,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:53,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:32:53,378 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:53,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1433823241, now seen corresponding path program 1 times [2025-02-05 16:32:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721081017] [2025-02-05 16:32:53,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:53,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:32:53,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:32:53,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:53,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721081017] [2025-02-05 16:32:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721081017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352182418] [2025-02-05 16:32:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:53,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:53,458 INFO L87 Difference]: Start difference. First operand 18558 states and 23561 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:53,550 INFO L93 Difference]: Finished difference Result 24422 states and 31161 transitions. [2025-02-05 16:32:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:32:53,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:32:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:53,574 INFO L225 Difference]: With dead ends: 24422 [2025-02-05 16:32:53,574 INFO L226 Difference]: Without dead ends: 20892 [2025-02-05 16:32:53,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:53,582 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 625 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:53,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 866 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20892 states. [2025-02-05 16:32:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20892 to 20466. [2025-02-05 16:32:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20466 states, 20465 states have (on average 1.26699242609333) internal successors, (25929), 20465 states have internal predecessors, (25929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20466 states to 20466 states and 25929 transitions. [2025-02-05 16:32:53,877 INFO L78 Accepts]: Start accepts. Automaton has 20466 states and 25929 transitions. Word has length 80 [2025-02-05 16:32:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:53,878 INFO L471 AbstractCegarLoop]: Abstraction has 20466 states and 25929 transitions. [2025-02-05 16:32:53,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 20466 states and 25929 transitions. [2025-02-05 16:32:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:32:53,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:53,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:32:53,883 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:53,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash -231795413, now seen corresponding path program 1 times [2025-02-05 16:32:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690059508] [2025-02-05 16:32:53,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:53,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:32:53,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:32:53,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:53,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:32:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690059508] [2025-02-05 16:32:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690059508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:32:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197578799] [2025-02-05 16:32:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:32:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:54,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:32:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:32:54,062 INFO L87 Difference]: Start difference. First operand 20466 states and 25929 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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-02-05 16:32:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:54,572 INFO L93 Difference]: Finished difference Result 44711 states and 56465 transitions. [2025-02-05 16:32:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:32:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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 95 [2025-02-05 16:32:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:54,613 INFO L225 Difference]: With dead ends: 44711 [2025-02-05 16:32:54,613 INFO L226 Difference]: Without dead ends: 33573 [2025-02-05 16:32:54,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:54,629 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1226 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:54,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 1002 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33573 states. [2025-02-05 16:32:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33573 to 20400. [2025-02-05 16:32:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20400 states, 20399 states have (on average 1.2672680033334967) internal successors, (25851), 20399 states have internal predecessors, (25851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20400 states to 20400 states and 25851 transitions. [2025-02-05 16:32:54,969 INFO L78 Accepts]: Start accepts. Automaton has 20400 states and 25851 transitions. Word has length 95 [2025-02-05 16:32:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:54,969 INFO L471 AbstractCegarLoop]: Abstraction has 20400 states and 25851 transitions. [2025-02-05 16:32:54,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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-02-05 16:32:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20400 states and 25851 transitions. [2025-02-05 16:32:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:32:54,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:54,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:32:54,976 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 104546868, now seen corresponding path program 1 times [2025-02-05 16:32:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033651640] [2025-02-05 16:32:54,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:54,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:32:55,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:32:55,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033651640] [2025-02-05 16:32:55,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033651640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459115223] [2025-02-05 16:32:55,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:55,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:55,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:55,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:32:55,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:32:55,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:32:55,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:32:55,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:55,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:55,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:32:55,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:55,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459115223] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:56,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 21 [2025-02-05 16:32:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995091461] [2025-02-05 16:32:56,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 16:32:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:56,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 16:32:56,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:32:56,799 INFO L87 Difference]: Start difference. First operand 20400 states and 25851 transitions. Second operand has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:59,862 INFO L93 Difference]: Finished difference Result 103051 states and 131448 transitions. [2025-02-05 16:32:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-05 16:32:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 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-02-05 16:32:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:59,946 INFO L225 Difference]: With dead ends: 103051 [2025-02-05 16:32:59,946 INFO L226 Difference]: Without dead ends: 83237 [2025-02-05 16:32:59,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=5594, Unknown=0, NotChecked=0, Total=6972 [2025-02-05 16:32:59,964 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 3411 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:59,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 3133 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:32:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83237 states. [2025-02-05 16:33:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83237 to 54239. [2025-02-05 16:33:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54239 states, 54238 states have (on average 1.2692577159924776) internal successors, (68842), 54238 states have internal predecessors, (68842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54239 states to 54239 states and 68842 transitions. [2025-02-05 16:33:00,530 INFO L78 Accepts]: Start accepts. Automaton has 54239 states and 68842 transitions. Word has length 95 [2025-02-05 16:33:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:00,530 INFO L471 AbstractCegarLoop]: Abstraction has 54239 states and 68842 transitions. [2025-02-05 16:33:00,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54239 states and 68842 transitions. [2025-02-05 16:33:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:33:00,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:00,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:00,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:33:00,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-05 16:33:00,745 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1313447477, now seen corresponding path program 1 times [2025-02-05 16:33:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:00,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35850751] [2025-02-05 16:33:00,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:00,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:33:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:33:00,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:00,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35850751] [2025-02-05 16:33:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35850751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:00,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:00,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321930470] [2025-02-05 16:33:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:00,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:00,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:00,828 INFO L87 Difference]: Start difference. First operand 54239 states and 68842 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:01,162 INFO L93 Difference]: Finished difference Result 109528 states and 138814 transitions. [2025-02-05 16:33:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-02-05 16:33:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:01,232 INFO L225 Difference]: With dead ends: 109528 [2025-02-05 16:33:01,232 INFO L226 Difference]: Without dead ends: 55965 [2025-02-05 16:33:01,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:01,274 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 512 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:01,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 463 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55965 states. [2025-02-05 16:33:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55965 to 52527. [2025-02-05 16:33:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52527 states, 52526 states have (on average 1.2475345543159577) internal successors, (65528), 52526 states have internal predecessors, (65528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52527 states to 52527 states and 65528 transitions. [2025-02-05 16:33:02,439 INFO L78 Accepts]: Start accepts. Automaton has 52527 states and 65528 transitions. Word has length 102 [2025-02-05 16:33:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:02,439 INFO L471 AbstractCegarLoop]: Abstraction has 52527 states and 65528 transitions. [2025-02-05 16:33:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 52527 states and 65528 transitions. [2025-02-05 16:33:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:33:02,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:02,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:02,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:33:02,451 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:02,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash -490668702, now seen corresponding path program 1 times [2025-02-05 16:33:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:02,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159902481] [2025-02-05 16:33:02,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:02,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:33:02,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:33:02,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:02,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:02,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159902481] [2025-02-05 16:33:02,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159902481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:02,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563144364] [2025-02-05 16:33:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:02,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:02,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:02,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:33:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:33:02,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:33:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:02,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:33:02,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:03,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563144364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:03,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:33:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456453179] [2025-02-05 16:33:03,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:03,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:33:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:03,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:33:03,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:33:03,192 INFO L87 Difference]: Start difference. First operand 52527 states and 65528 transitions. Second operand has 14 states, 14 states have (on average 20.0) internal successors, (280), 14 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:03,795 INFO L93 Difference]: Finished difference Result 104581 states and 130215 transitions. [2025-02-05 16:33:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:33:03,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.0) internal successors, (280), 14 states have internal predecessors, (280), 0 states have call successors, (0), 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 102 [2025-02-05 16:33:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:03,881 INFO L225 Difference]: With dead ends: 104581 [2025-02-05 16:33:03,881 INFO L226 Difference]: Without dead ends: 52730 [2025-02-05 16:33:03,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:33:03,927 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1554 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:03,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 928 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52730 states. [2025-02-05 16:33:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52730 to 47416. [2025-02-05 16:33:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47416 states, 47415 states have (on average 1.2237266687757038) internal successors, (58023), 47415 states have internal predecessors, (58023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47416 states to 47416 states and 58023 transitions. [2025-02-05 16:33:04,592 INFO L78 Accepts]: Start accepts. Automaton has 47416 states and 58023 transitions. Word has length 102 [2025-02-05 16:33:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 47416 states and 58023 transitions. [2025-02-05 16:33:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.0) internal successors, (280), 14 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47416 states and 58023 transitions. [2025-02-05 16:33:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:33:04,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:04,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:04,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:33:04,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:04,812 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1590788762, now seen corresponding path program 1 times [2025-02-05 16:33:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193083524] [2025-02-05 16:33:04,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:33:04,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:33:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193083524] [2025-02-05 16:33:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193083524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840754438] [2025-02-05 16:33:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:04,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:04,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:04,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:33:05,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:33:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:33:05,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:05,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:05,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:33:05,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:05,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840754438] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:05,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:05,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:33:05,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361566637] [2025-02-05 16:33:05,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:05,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:33:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:05,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:33:05,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:33:05,852 INFO L87 Difference]: Start difference. First operand 47416 states and 58023 transitions. Second operand has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:06,400 INFO L93 Difference]: Finished difference Result 106633 states and 130311 transitions. [2025-02-05 16:33:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:33:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 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 103 [2025-02-05 16:33:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:06,469 INFO L225 Difference]: With dead ends: 106633 [2025-02-05 16:33:06,469 INFO L226 Difference]: Without dead ends: 59791 [2025-02-05 16:33:06,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:33:06,482 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2586 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2586 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:06,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2586 Valid, 779 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59791 states. [2025-02-05 16:33:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59791 to 49856. [2025-02-05 16:33:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49856 states, 49855 states have (on average 1.2052752983652593) internal successors, (60089), 49855 states have internal predecessors, (60089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49856 states to 49856 states and 60089 transitions. [2025-02-05 16:33:06,986 INFO L78 Accepts]: Start accepts. Automaton has 49856 states and 60089 transitions. Word has length 103 [2025-02-05 16:33:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 49856 states and 60089 transitions. [2025-02-05 16:33:06,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49856 states and 60089 transitions. [2025-02-05 16:33:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:33:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:06,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:33:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:07,196 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -559148377, now seen corresponding path program 1 times [2025-02-05 16:33:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194300304] [2025-02-05 16:33:07,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:07,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:33:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:33:07,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194300304] [2025-02-05 16:33:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194300304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:33:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074511662] [2025-02-05 16:33:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:33:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:33:07,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:33:07,506 INFO L87 Difference]: Start difference. First operand 49856 states and 60089 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:08,277 INFO L93 Difference]: Finished difference Result 98814 states and 119043 transitions. [2025-02-05 16:33:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:33:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-02-05 16:33:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:08,359 INFO L225 Difference]: With dead ends: 98814 [2025-02-05 16:33:08,359 INFO L226 Difference]: Without dead ends: 78086 [2025-02-05 16:33:08,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:33:08,384 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 650 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:08,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1006 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:33:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78086 states. [2025-02-05 16:33:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78086 to 75818. [2025-02-05 16:33:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75818 states, 75817 states have (on average 1.2054024822928895) internal successors, (91390), 75817 states have internal predecessors, (91390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75818 states to 75818 states and 91390 transitions. [2025-02-05 16:33:09,113 INFO L78 Accepts]: Start accepts. Automaton has 75818 states and 91390 transitions. Word has length 105 [2025-02-05 16:33:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:09,113 INFO L471 AbstractCegarLoop]: Abstraction has 75818 states and 91390 transitions. [2025-02-05 16:33:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 75818 states and 91390 transitions. [2025-02-05 16:33:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:33:09,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:09,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:09,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:33:09,122 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:09,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1380772824, now seen corresponding path program 1 times [2025-02-05 16:33:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112042485] [2025-02-05 16:33:09,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:09,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:33:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:33:09,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:09,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:33:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:09,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112042485] [2025-02-05 16:33:09,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112042485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037447995] [2025-02-05 16:33:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:09,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:33:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:09,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:33:09,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:09,350 INFO L87 Difference]: Start difference. First operand 75818 states and 91390 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:09,724 INFO L93 Difference]: Finished difference Result 98033 states and 116937 transitions. [2025-02-05 16:33:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:33:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 105 [2025-02-05 16:33:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:09,811 INFO L225 Difference]: With dead ends: 98033 [2025-02-05 16:33:09,811 INFO L226 Difference]: Without dead ends: 84008 [2025-02-05 16:33:09,839 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-02-05 16:33:09,840 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1185 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:09,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 491 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84008 states. [2025-02-05 16:33:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84008 to 75724. [2025-02-05 16:33:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75724 states, 75723 states have (on average 1.2054725776844553) internal successors, (91282), 75723 states have internal predecessors, (91282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75724 states to 75724 states and 91282 transitions. [2025-02-05 16:33:10,818 INFO L78 Accepts]: Start accepts. Automaton has 75724 states and 91282 transitions. Word has length 105 [2025-02-05 16:33:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:10,819 INFO L471 AbstractCegarLoop]: Abstraction has 75724 states and 91282 transitions. [2025-02-05 16:33:10,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 75724 states and 91282 transitions. [2025-02-05 16:33:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:33:10,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:10,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:10,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:33:10,827 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1684421041, now seen corresponding path program 1 times [2025-02-05 16:33:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521807022] [2025-02-05 16:33:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:33:10,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:33:10,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:10,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521807022] [2025-02-05 16:33:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521807022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754396858] [2025-02-05 16:33:11,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:11,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:11,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:33:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:33:11,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:33:11,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:11,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:11,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:33:11,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:12,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754396858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:13,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 31 [2025-02-05 16:33:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684926605] [2025-02-05 16:33:13,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:33:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:13,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:33:13,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:33:13,063 INFO L87 Difference]: Start difference. First operand 75724 states and 91282 transitions. Second operand has 32 states, 32 states have (on average 8.0625) internal successors, (258), 31 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:15,661 INFO L93 Difference]: Finished difference Result 222881 states and 267796 transitions. [2025-02-05 16:33:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 16:33:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.0625) internal successors, (258), 31 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:33:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:16,219 INFO L225 Difference]: With dead ends: 222881 [2025-02-05 16:33:16,219 INFO L226 Difference]: Without dead ends: 186795 [2025-02-05 16:33:16,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1039, Invalid=3653, Unknown=0, NotChecked=0, Total=4692 [2025-02-05 16:33:16,252 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 6191 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6191 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:16,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6191 Valid, 2989 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:33:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186795 states. [2025-02-05 16:33:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186795 to 76928. [2025-02-05 16:33:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76928 states, 76927 states have (on average 1.204427574193716) internal successors, (92653), 76927 states have internal predecessors, (92653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76928 states to 76928 states and 92653 transitions. [2025-02-05 16:33:17,555 INFO L78 Accepts]: Start accepts. Automaton has 76928 states and 92653 transitions. Word has length 106 [2025-02-05 16:33:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:17,555 INFO L471 AbstractCegarLoop]: Abstraction has 76928 states and 92653 transitions. [2025-02-05 16:33:17,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.0625) internal successors, (258), 31 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76928 states and 92653 transitions. [2025-02-05 16:33:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:33:17,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:17,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:17,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:33:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-05 16:33:17,768 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:17,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1253671246, now seen corresponding path program 1 times [2025-02-05 16:33:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:17,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119303972] [2025-02-05 16:33:17,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:33:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:33:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:33:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119303972] [2025-02-05 16:33:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119303972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:33:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916588545] [2025-02-05 16:33:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:17,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:33:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:17,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:33:17,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:33:17,940 INFO L87 Difference]: Start difference. First operand 76928 states and 92653 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:18,713 INFO L93 Difference]: Finished difference Result 128862 states and 155301 transitions. [2025-02-05 16:33:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:33:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 107 [2025-02-05 16:33:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:18,786 INFO L225 Difference]: With dead ends: 128862 [2025-02-05 16:33:18,787 INFO L226 Difference]: Without dead ends: 77808 [2025-02-05 16:33:18,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:33:18,807 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1132 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:18,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1056 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77808 states. [2025-02-05 16:33:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77808 to 76850. [2025-02-05 16:33:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76850 states, 76849 states have (on average 1.2044919257244726) internal successors, (92564), 76849 states have internal predecessors, (92564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76850 states to 76850 states and 92564 transitions. [2025-02-05 16:33:19,552 INFO L78 Accepts]: Start accepts. Automaton has 76850 states and 92564 transitions. Word has length 107 [2025-02-05 16:33:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:19,552 INFO L471 AbstractCegarLoop]: Abstraction has 76850 states and 92564 transitions. [2025-02-05 16:33:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 76850 states and 92564 transitions. [2025-02-05 16:33:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:33:19,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:19,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:19,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:33:19,562 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:19,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1540081032, now seen corresponding path program 1 times [2025-02-05 16:33:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810993043] [2025-02-05 16:33:19,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:19,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:19,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:19,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810993043] [2025-02-05 16:33:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810993043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102777831] [2025-02-05 16:33:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:20,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:20,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:20,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:33:20,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:20,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:20,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:20,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:20,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:33:20,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:21,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102777831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:21,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 32 [2025-02-05 16:33:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792226940] [2025-02-05 16:33:21,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:33:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:21,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:33:21,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:33:21,706 INFO L87 Difference]: Start difference. First operand 76850 states and 92564 transitions. Second operand has 32 states, 32 states have (on average 8.1875) internal successors, (262), 32 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:23,632 INFO L93 Difference]: Finished difference Result 148988 states and 178927 transitions. [2025-02-05 16:33:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 16:33:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.1875) internal successors, (262), 32 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 16:33:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:23,796 INFO L225 Difference]: With dead ends: 148988 [2025-02-05 16:33:23,796 INFO L226 Difference]: Without dead ends: 138284 [2025-02-05 16:33:23,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=764, Invalid=3018, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 16:33:23,844 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 3587 mSDsluCounter, 5783 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 6194 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:23,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 6194 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:33:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138284 states. [2025-02-05 16:33:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138284 to 76908. [2025-02-05 16:33:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76908 states, 76907 states have (on average 1.2043637120158113) internal successors, (92624), 76907 states have internal predecessors, (92624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76908 states to 76908 states and 92624 transitions. [2025-02-05 16:33:25,285 INFO L78 Accepts]: Start accepts. Automaton has 76908 states and 92624 transitions. Word has length 108 [2025-02-05 16:33:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:25,285 INFO L471 AbstractCegarLoop]: Abstraction has 76908 states and 92624 transitions. [2025-02-05 16:33:25,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.1875) internal successors, (262), 32 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 76908 states and 92624 transitions. [2025-02-05 16:33:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:33:25,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:25,304 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] [2025-02-05 16:33:25,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:33:25,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:25,505 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:25,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1391199884, now seen corresponding path program 1 times [2025-02-05 16:33:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610658166] [2025-02-05 16:33:25,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:25,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:25,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:25,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:25,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610658166] [2025-02-05 16:33:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610658166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:25,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:25,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021550329] [2025-02-05 16:33:25,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:25,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:25,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:25,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:25,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:25,574 INFO L87 Difference]: Start difference. First operand 76908 states and 92624 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:25,998 INFO L93 Difference]: Finished difference Result 104814 states and 125990 transitions. [2025-02-05 16:33:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 16:33:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:26,193 INFO L225 Difference]: With dead ends: 104814 [2025-02-05 16:33:26,193 INFO L226 Difference]: Without dead ends: 81183 [2025-02-05 16:33:26,254 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-02-05 16:33:26,254 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 98 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:26,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 598 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81183 states. [2025-02-05 16:33:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81183 to 81093. [2025-02-05 16:33:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81093 states, 81092 states have (on average 1.1981329847580526) internal successors, (97159), 81092 states have internal predecessors, (97159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81093 states to 81093 states and 97159 transitions. [2025-02-05 16:33:27,983 INFO L78 Accepts]: Start accepts. Automaton has 81093 states and 97159 transitions. Word has length 108 [2025-02-05 16:33:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:27,985 INFO L471 AbstractCegarLoop]: Abstraction has 81093 states and 97159 transitions. [2025-02-05 16:33:27,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 81093 states and 97159 transitions. [2025-02-05 16:33:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:33:27,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:27,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:27,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:33:27,998 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -643678873, now seen corresponding path program 1 times [2025-02-05 16:33:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050253585] [2025-02-05 16:33:27,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:27,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:28,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:28,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:28,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:28,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050253585] [2025-02-05 16:33:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050253585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345478270] [2025-02-05 16:33:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:28,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:28,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:28,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:33:29,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:29,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:29,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:33:29,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:30,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:33:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345478270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:33:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [20] total 29 [2025-02-05 16:33:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729306863] [2025-02-05 16:33:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:33:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:30,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:33:30,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:33:30,069 INFO L87 Difference]: Start difference. First operand 81093 states and 97159 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 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-02-05 16:33:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:30,764 INFO L93 Difference]: Finished difference Result 112353 states and 134353 transitions. [2025-02-05 16:33:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:33:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 16:33:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:30,868 INFO L225 Difference]: With dead ends: 112353 [2025-02-05 16:33:30,868 INFO L226 Difference]: Without dead ends: 93951 [2025-02-05 16:33:30,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:33:30,901 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 666 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:30,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2796 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93951 states. [2025-02-05 16:33:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93951 to 92761. [2025-02-05 16:33:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92761 states, 92760 states have (on average 1.1967874083656749) internal successors, (111014), 92760 states have internal predecessors, (111014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92761 states to 92761 states and 111014 transitions. [2025-02-05 16:33:31,833 INFO L78 Accepts]: Start accepts. Automaton has 92761 states and 111014 transitions. Word has length 108 [2025-02-05 16:33:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 92761 states and 111014 transitions. [2025-02-05 16:33:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 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-02-05 16:33:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 92761 states and 111014 transitions. [2025-02-05 16:33:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:33:31,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:31,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:31,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 16:33:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-05 16:33:32,042 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:32,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1225742584, now seen corresponding path program 1 times [2025-02-05 16:33:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535386542] [2025-02-05 16:33:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:32,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:32,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:32,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535386542] [2025-02-05 16:33:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535386542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758125603] [2025-02-05 16:33:32,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:32,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:32,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:32,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:33:32,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:33:32,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:33:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:32,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:33:32,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:33,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758125603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 32 [2025-02-05 16:33:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385385486] [2025-02-05 16:33:33,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:33:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:33,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:33:33,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:33:33,796 INFO L87 Difference]: Start difference. First operand 92761 states and 111014 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:35,152 INFO L93 Difference]: Finished difference Result 121578 states and 145424 transitions. [2025-02-05 16:33:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 16:33:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 16:33:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:35,277 INFO L225 Difference]: With dead ends: 121578 [2025-02-05 16:33:35,278 INFO L226 Difference]: Without dead ends: 104672 [2025-02-05 16:33:35,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=701, Invalid=2491, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 16:33:35,317 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 2600 mSDsluCounter, 5074 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:35,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 5468 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:33:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104672 states. [2025-02-05 16:33:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104672 to 96224. [2025-02-05 16:33:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96224 states, 96223 states have (on average 1.1949741745736466) internal successors, (114984), 96223 states have internal predecessors, (114984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96224 states to 96224 states and 114984 transitions. [2025-02-05 16:33:36,494 INFO L78 Accepts]: Start accepts. Automaton has 96224 states and 114984 transitions. Word has length 108 [2025-02-05 16:33:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 96224 states and 114984 transitions. [2025-02-05 16:33:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 96224 states and 114984 transitions. [2025-02-05 16:33:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:33:36,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:36,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:36,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 16:33:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:36,704 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1939791745, now seen corresponding path program 1 times [2025-02-05 16:33:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937725647] [2025-02-05 16:33:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:36,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:36,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:37,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:37,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937725647] [2025-02-05 16:33:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937725647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:37,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:37,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:33:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597080104] [2025-02-05 16:33:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:33:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:37,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:33:37,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:33:37,517 INFO L87 Difference]: Start difference. First operand 96224 states and 114984 transitions. Second operand has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:38,966 INFO L93 Difference]: Finished difference Result 138166 states and 165280 transitions. [2025-02-05 16:33:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 16:33:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:33:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:39,129 INFO L225 Difference]: With dead ends: 138166 [2025-02-05 16:33:39,130 INFO L226 Difference]: Without dead ends: 136281 [2025-02-05 16:33:39,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=1555, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:33:39,176 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1412 mSDsluCounter, 4614 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:39,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 5031 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:33:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136281 states. [2025-02-05 16:33:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136281 to 98802. [2025-02-05 16:33:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98802 states, 98801 states have (on average 1.195726763899151) internal successors, (118139), 98801 states have internal predecessors, (118139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98802 states to 98802 states and 118139 transitions. [2025-02-05 16:33:40,658 INFO L78 Accepts]: Start accepts. Automaton has 98802 states and 118139 transitions. Word has length 109 [2025-02-05 16:33:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:40,658 INFO L471 AbstractCegarLoop]: Abstraction has 98802 states and 118139 transitions. [2025-02-05 16:33:40,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 98802 states and 118139 transitions. [2025-02-05 16:33:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:33:40,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:40,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:40,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:33:40,665 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1421289344, now seen corresponding path program 1 times [2025-02-05 16:33:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784338551] [2025-02-05 16:33:40,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:40,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:40,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:40,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:33:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784338551] [2025-02-05 16:33:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784338551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629617849] [2025-02-05 16:33:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:33:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:40,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:33:40,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:33:40,712 INFO L87 Difference]: Start difference. First operand 98802 states and 118139 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:41,081 INFO L93 Difference]: Finished difference Result 155462 states and 185504 transitions. [2025-02-05 16:33:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:33:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:41,236 INFO L225 Difference]: With dead ends: 155462 [2025-02-05 16:33:41,237 INFO L226 Difference]: Without dead ends: 129973 [2025-02-05 16:33:41,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:41,285 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 164 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:41,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 613 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129973 states. [2025-02-05 16:33:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129973 to 108661. [2025-02-05 16:33:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108661 states, 108660 states have (on average 1.195849438615866) internal successors, (129941), 108660 states have internal predecessors, (129941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108661 states to 108661 states and 129941 transitions. [2025-02-05 16:33:42,925 INFO L78 Accepts]: Start accepts. Automaton has 108661 states and 129941 transitions. Word has length 109 [2025-02-05 16:33:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:42,926 INFO L471 AbstractCegarLoop]: Abstraction has 108661 states and 129941 transitions. [2025-02-05 16:33:42,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 108661 states and 129941 transitions. [2025-02-05 16:33:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:33:42,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:42,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 16:33:42,937 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1599194259, now seen corresponding path program 1 times [2025-02-05 16:33:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434076020] [2025-02-05 16:33:42,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:42,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:42,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:42,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:43,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434076020] [2025-02-05 16:33:43,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434076020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:43,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:43,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:43,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727570526] [2025-02-05 16:33:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:43,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:43,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:43,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:43,029 INFO L87 Difference]: Start difference. First operand 108661 states and 129941 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:43,683 INFO L93 Difference]: Finished difference Result 208058 states and 248489 transitions. [2025-02-05 16:33:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:43,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:33:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:43,824 INFO L225 Difference]: With dead ends: 208058 [2025-02-05 16:33:43,824 INFO L226 Difference]: Without dead ends: 101332 [2025-02-05 16:33:43,890 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-02-05 16:33:43,891 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 111 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:43,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 440 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101332 states. [2025-02-05 16:33:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101332 to 101330. [2025-02-05 16:33:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101330 states, 101329 states have (on average 1.1667933168194693) internal successors, (118230), 101329 states have internal predecessors, (118230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101330 states to 101330 states and 118230 transitions. [2025-02-05 16:33:44,961 INFO L78 Accepts]: Start accepts. Automaton has 101330 states and 118230 transitions. Word has length 109 [2025-02-05 16:33:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 101330 states and 118230 transitions. [2025-02-05 16:33:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 101330 states and 118230 transitions. [2025-02-05 16:33:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:33:44,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:44,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 16:33:44,968 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1038107872, now seen corresponding path program 1 times [2025-02-05 16:33:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561139657] [2025-02-05 16:33:44,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:45,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:45,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:45,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561139657] [2025-02-05 16:33:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561139657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25925151] [2025-02-05 16:33:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:46,094 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:46,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:33:46,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:46,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:46,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:46,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 16:33:46,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:33:46,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:33:46,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25925151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:46,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:33:46,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [22] total 35 [2025-02-05 16:33:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757910300] [2025-02-05 16:33:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:46,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 16:33:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:46,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 16:33:46,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:33:46,945 INFO L87 Difference]: Start difference. First operand 101330 states and 118230 transitions. Second operand has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:48,089 INFO L93 Difference]: Finished difference Result 165953 states and 193908 transitions. [2025-02-05 16:33:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:33:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:33:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:48,288 INFO L225 Difference]: With dead ends: 165953 [2025-02-05 16:33:48,288 INFO L226 Difference]: Without dead ends: 154729 [2025-02-05 16:33:48,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:33:48,323 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1260 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:48,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2011 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:33:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154729 states. [2025-02-05 16:33:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154729 to 100414. [2025-02-05 16:33:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100414 states, 100413 states have (on average 1.1671496718552379) internal successors, (117197), 100413 states have internal predecessors, (117197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100414 states to 100414 states and 117197 transitions. [2025-02-05 16:33:49,720 INFO L78 Accepts]: Start accepts. Automaton has 100414 states and 117197 transitions. Word has length 109 [2025-02-05 16:33:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:49,721 INFO L471 AbstractCegarLoop]: Abstraction has 100414 states and 117197 transitions. [2025-02-05 16:33:49,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 100414 states and 117197 transitions. [2025-02-05 16:33:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:33:49,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:49,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:49,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 16:33:49,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-05 16:33:49,931 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:33:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1349204204, now seen corresponding path program 1 times [2025-02-05 16:33:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143532154] [2025-02-05 16:33:49,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:49,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:49,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:49,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:49,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143532154] [2025-02-05 16:33:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143532154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036886758] [2025-02-05 16:33:50,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:50,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:50,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:50,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:33:50,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:33:50,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:33:50,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:50,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:50,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:33:50,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:51,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036886758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:52,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 36 [2025-02-05 16:33:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498219240] [2025-02-05 16:33:52,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 16:33:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 16:33:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:33:52,301 INFO L87 Difference]: Start difference. First operand 100414 states and 117197 transitions. Second operand has 37 states, 37 states have (on average 8.18918918918919) internal successors, (303), 36 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)