./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 755ab1a46ae9bd419f57fa80d8e9c25878a5804529700435e5fe8941ed66455d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:28:15,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:28:15,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:28:15,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:28:15,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:28:15,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:28:15,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:28:15,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:28:15,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:28:15,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:28:15,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:28:15,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:28:15,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:28:15,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:28:15,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:28:15,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:15,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:28:15,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:28:15,312 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 755ab1a46ae9bd419f57fa80d8e9c25878a5804529700435e5fe8941ed66455d [2025-03-16 19:28:15,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:28:15,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:28:15,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:28:15,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:28:15,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:28:15,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-16 19:28:16,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace70c49d/e314e425977941f5b94883747ee0056d/FLAGd67d1ff38 [2025-03-16 19:28:17,139 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:28:17,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-16 19:28:17,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace70c49d/e314e425977941f5b94883747ee0056d/FLAGd67d1ff38 [2025-03-16 19:28:17,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace70c49d/e314e425977941f5b94883747ee0056d [2025-03-16 19:28:17,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:28:17,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:28:17,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:17,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:28:17,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:28:17,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:17" (1/1) ... [2025-03-16 19:28:17,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:17, skipping insertion in model container [2025-03-16 19:28:17,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:17" (1/1) ... [2025-03-16 19:28:17,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:28:17,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[14256,14269] [2025-03-16 19:28:17,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20101,20114] [2025-03-16 19:28:17,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[21333,21346] [2025-03-16 19:28:17,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23565,23578] [2025-03-16 19:28:17,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[26974,26987] [2025-03-16 19:28:17,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[33563,33576] [2025-03-16 19:28:18,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:18,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:28:18,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[14256,14269] [2025-03-16 19:28:18,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20101,20114] [2025-03-16 19:28:18,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[21333,21346] [2025-03-16 19:28:18,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23565,23578] [2025-03-16 19:28:18,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[26974,26987] [2025-03-16 19:28:18,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[33563,33576] [2025-03-16 19:28:18,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:18,458 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:28:18,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18 WrapperNode [2025-03-16 19:28:18,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:18,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:18,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:28:18,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:28:18,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,614 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10106 [2025-03-16 19:28:18,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:18,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:28:18,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:28:18,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:28:18,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,788 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:28:18,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:28:18,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:28:18,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:28:18,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:28:18,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (1/1) ... [2025-03-16 19:28:18,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:28:18,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:28:18,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:28:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:28:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:28:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:28:18,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:28:19,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:28:19,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12655: havoc main_~node5__m5~69#1; [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3673: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~23#1; [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11602: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~110#1;havoc main_~node5____CPAchecker_TMP_0~48#1; [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15830: havoc main_~node5____CPAchecker_TMP_1~71#1; [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8961: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~81#1; [2025-03-16 19:28:22,543 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7640: havoc main_~node5____CPAchecker_TMP_1~26#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~20#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7905: havoc main_~node5__m5~43#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11341: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~107#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7113: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8699: havoc main_~node5____CPAchecker_TMP_1~32#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7378: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13192: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6852: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node5____CPAchecker_TMP_0~22#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15573: havoc main_~node5__m5~85#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~29#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10024: havoc main_~node5____CPAchecker_TMP_1~39#1; [2025-03-16 19:28:22,544 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5796: havoc main_~node5____CPAchecker_TMP_1~16#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10289: havoc main_~node4__m4~19#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~17#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11084: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~104#1;havoc main_~node5____CPAchecker_TMP_0~45#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3949: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~26#1;havoc main_~node5____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node2__m2~1#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8442: havoc main_~node5__m5~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13464: havoc main_~node5____CPAchecker_TMP_1~58#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7387: havoc main_~node5__m5~40#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13729: havoc main_~node5__m5~75#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13202: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8181: havoc main_~node5____CPAchecker_TMP_1~29#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5539: havoc main_~node5__m5~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9767: havoc main_~node5__m5~53#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10561: havoc main_~node5____CPAchecker_TMP_1~42#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6333: havoc main_~node5____CPAchecker_TMP_1~19#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10826: havoc main_~node5__m5~59#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5278: havoc main_~node5____CPAchecker_TMP_1~13#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10299: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13211: havoc main_~node5__m5~72#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6076: havoc main_~node5__m5~33#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585: havoc main_~node5__m5~5#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14534: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~142#1;havoc main_~node5____CPAchecker_TMP_0~64#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908: havoc main_~node5__m5~16#1;havoc main_~node4__m4~9#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10308: havoc main_~node5__m5~56#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc main_~node5____CPAchecker_TMP_1~35#1; [2025-03-16 19:28:22,545 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5023: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1;havoc main_~node5____CPAchecker_TMP_0~12#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node3__m3~1#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14273: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~139#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15332: havoc main_~main____CPAchecker_TMP_0~137#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~151#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4762: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6613: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635: havoc main_~node5____CPAchecker_TMP_1~48#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15071: havoc main_~main____CPAchecker_TMP_0~134#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~148#1;havoc main_~node5____CPAchecker_TMP_0~67#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12429: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~119#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8994: havoc main_~node5__m5~49#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: havoc main_~node5____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc main_~node4__m4~10#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14016: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~136#1;havoc main_~node5____CPAchecker_TMP_0~61#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12168: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~116#1;havoc main_~node5____CPAchecker_TMP_0~51#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4505: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~32#1;havoc main_~node5____CPAchecker_TMP_0~9#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6885: havoc main_~node5____CPAchecker_TMP_1~22#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11378: havoc main_~node5__m5~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7150: havoc main_~node5__m5~39#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14814: havoc main_~main____CPAchecker_TMP_0~131#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~145#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6623: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc main_~node5__m5~17#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L810: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:22,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12966: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~125#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11117: havoc main_~node5____CPAchecker_TMP_1~45#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3982: havoc main_~node5____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc main_~node5__m5~23#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node4__m4~1#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11911: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~113#1; [2025-03-16 19:28:22,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3720: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12705: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~122#1;havoc main_~node5____CPAchecker_TMP_0~54#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: havoc main_~check__tmp~14#1;havoc main_~node5__m5~11#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9538: havoc main_~node2__m2~4#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc main_~node5__m5~36#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7955: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~70#1;havoc main_~node5____CPAchecker_TMP_0~28#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15884: havoc main_~main____CPAchecker_TMP_0~143#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~157#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729: havoc main_~node5__m5~20#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~67#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15623: havoc main_~main____CPAchecker_TMP_0~140#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~154#1;havoc main_~node5____CPAchecker_TMP_0~70#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8753: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~79#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14567: havoc main_~node5____CPAchecker_TMP_1~64#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: havoc main_~check__tmp~10#1;havoc main_~node5__m5~7#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9548: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:22,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc main_~node5____CPAchecker_TMP_1~12#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~76#1;havoc main_~node5____CPAchecker_TMP_0~31#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5850: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~47#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10078: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~93#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_~node5__m5~1#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13779: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~134#1;havoc main_~node5____CPAchecker_TMP_0~60#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7437: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~64#1;havoc main_~node5____CPAchecker_TMP_0~25#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1096: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9817: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~90#1;havoc main_~node5____CPAchecker_TMP_0~38#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5589: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~44#1;havoc main_~node5____CPAchecker_TMP_0~15#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14310: havoc main_~node5__m5~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13518: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~131#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10876: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~102#1;havoc main_~node5____CPAchecker_TMP_0~44#1; [2025-03-16 19:28:22,549 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15104: havoc main_~node5____CPAchecker_TMP_1~67#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4799: havoc main_~node5__m5~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8235: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~73#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14049: havoc main_~node5____CPAchecker_TMP_1~61#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6387: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~53#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9558: havoc main_~node3__m3~8#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10615: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~99#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L838: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12201: havoc main_~node5____CPAchecker_TMP_1~51#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4538: havoc main_~node5____CPAchecker_TMP_1~9#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12466: havoc main_~node4__m4~22#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5332: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~41#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1369: havoc main_~check__tmp~5#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~50#1;havoc main_~node5____CPAchecker_TMP_0~18#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13261: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~128#1;havoc main_~node5____CPAchecker_TMP_0~57#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691: havoc main_~node3__m3~5#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14847: havoc main_~node5__m5~81#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10358: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~96#1;havoc main_~node5____CPAchecker_TMP_0~41#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11944: havoc main_~node5__m5~65#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12738: havoc main_~node5____CPAchecker_TMP_1~54#1; [2025-03-16 19:28:22,550 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13003: havoc main_~node5__m5~71#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9568: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12476: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9305: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~85#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15384: havoc main_~node4__m4~26#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~82#1;havoc main_~node5____CPAchecker_TMP_0~34#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7988: havoc main_~node5____CPAchecker_TMP_1~28#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11689: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~111#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~21#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9578: havoc main_~node4__m4~18#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11428: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~108#1;havoc main_~node5____CPAchecker_TMP_0~47#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12485: havoc main_~node5__m5~68#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc main_~node5____CPAchecker_TMP_1~70#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7200: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1;havoc main_~node5____CPAchecker_TMP_0~24#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2708: havoc main_~node4__m4~8#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15921: havoc main_~node5__m5~87#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15394: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3238: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~18#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7731: havoc main_~node5__m5~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6939: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8525: havoc main_~node5____CPAchecker_TMP_1~31#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4297: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~30#1;havoc main_~node5____CPAchecker_TMP_0~8#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13812: havoc main_~node5____CPAchecker_TMP_1~60#1; [2025-03-16 19:28:22,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: havoc main_~node5____CPAchecker_TMP_1~25#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11171: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~105#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4036: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~27#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9850: havoc main_~node5____CPAchecker_TMP_1~38#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5622: havoc main_~node5____CPAchecker_TMP_1~15#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10115: havoc main_~node5__m5~55#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5887: havoc main_~node4__m4~13#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10909: havoc main_~node5____CPAchecker_TMP_1~44#1; [2025-03-16 19:28:22,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9588: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6682: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~56#1;havoc main_~node5____CPAchecker_TMP_0~21#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node5__m5~84#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8268: havoc main_~node5__m5~45#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13555: havoc main_~node5__m5~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~24#1;havoc main_~node5____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5365: havoc main_~node5__m5~29#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6159: havoc main_~node5____CPAchecker_TMP_1~18#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13294: havoc main_~node5____CPAchecker_TMP_1~57#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10652: havoc main_~node5__m5~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6424: havoc main_~node5__m5~35#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: havoc main_~node2__m2~3#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5897: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9597: havoc main_~node5__m5~52#1; [2025-03-16 19:28:22,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8805: havoc main_~node4__m4~17#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10391: havoc main_~node5____CPAchecker_TMP_1~41#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14621: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~143#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5110: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14360: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~140#1;havoc main_~node5____CPAchecker_TMP_0~63#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: 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-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9077: havoc main_~node5____CPAchecker_TMP_1~34#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5906: havoc main_~node5__m5~32#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4849: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~36#1;havoc main_~node5____CPAchecker_TMP_0~11#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9342: havoc main_~node5__m5~51#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8815: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15158: havoc main_~main____CPAchecker_TMP_0~135#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~149#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14103: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~137#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11461: havoc main_~node5____CPAchecker_TMP_1~47#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7233: havoc main_~node5____CPAchecker_TMP_1~24#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14897: havoc main_~main____CPAchecker_TMP_0~132#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~146#1;havoc main_~node5____CPAchecker_TMP_0~66#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12255: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~117#1; [2025-03-16 19:28:22,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4592: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2214: havoc main_~node3__m3~4#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3271: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536: havoc main_~node5__m5~19#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4330: havoc main_~node5____CPAchecker_TMP_1~8#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11994: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~114#1;havoc main_~node5____CPAchecker_TMP_0~50#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L896: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8824: havoc main_~node5__m5~48#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13053: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~126#1;havoc main_~node5____CPAchecker_TMP_0~56#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc main_~node4__m4~7#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11204: havoc main_~node5__m5~61#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc main_~node5__m5~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735: havoc main_~node3__m3~9#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12792: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~123#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6715: havoc main_~node5____CPAchecker_TMP_1~21#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4073: havoc main_~node5__m5~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: havoc main_~check__tmp~16#1;havoc main_~node5__m5~14#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695: havoc main_~node3__m3~3#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L638: havoc main_~node2__m2~2#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3812: havoc main_~node5____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8042: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~71#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: havoc main_~node4__m4~5#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12535: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~120#1;havoc main_~node5____CPAchecker_TMP_0~53#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15971: havoc main_~main____CPAchecker_TMP_0~144#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~158#1;havoc main_~node5____CPAchecker_TMP_0~72#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231: havoc main_~node4__m4~6#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7781: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~68#1;havoc main_~node5____CPAchecker_TMP_0~27#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11745: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15710: havoc main_~main____CPAchecker_TMP_0~141#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~155#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~3#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8579: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~77#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10165: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~94#1;havoc main_~node5____CPAchecker_TMP_0~40#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14393: havoc main_~node5____CPAchecker_TMP_1~63#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14658: havoc main_~node4__m4~25#1; [2025-03-16 19:28:22,555 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13866: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~135#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7524: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~65#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4882: havoc main_~node5____CPAchecker_TMP_1~11#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8318: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~74#1;havoc main_~node5____CPAchecker_TMP_0~30#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15453: havoc main_~main____CPAchecker_TMP_0~138#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~152#1;havoc main_~node5____CPAchecker_TMP_0~69#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1712: havoc main_~node4__m4~4#1; [2025-03-16 19:28:22,556 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9904: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~91#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5676: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~45#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L656: havoc main_~node3__m3~2#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11755: havoc main_~node4__m4~21#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13605: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~132#1;havoc main_~node5____CPAchecker_TMP_0~59#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10963: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~103#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~42#1;havoc main_~node5____CPAchecker_TMP_0~14#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14136: havoc main_~node5__m5~77#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14930: havoc main_~node5____CPAchecker_TMP_1~66#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6474: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~54#1;havoc main_~node5____CPAchecker_TMP_0~20#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10702: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~100#1;havoc main_~node5____CPAchecker_TMP_0~43#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15195: havoc main_~node5__m5~83#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4625: havoc main_~node5__m5~25#1; [2025-03-16 19:28:22,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14668: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9647: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~88#1;havoc main_~node5____CPAchecker_TMP_0~37#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248: havoc main_~node5__m5~10#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~0#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13348: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~129#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6213: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~51#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5156: havoc main_~node3__m3~6#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12027: havoc main_~node5____CPAchecker_TMP_1~50#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12292: havoc main_~node5__m5~67#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1458: havoc main_~node5__m5~4#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13086: havoc main_~node5____CPAchecker_TMP_1~56#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11765: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10445: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~97#1; [2025-03-16 19:28:22,558 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~48#1;havoc main_~node5____CPAchecker_TMP_0~17#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14677: havoc main_~node5__m5~80#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9392: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~86#1;havoc main_~node5____CPAchecker_TMP_0~36#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: havoc main_~node5__m5~6#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12829: havoc main_~node5__m5~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5166: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node4__m4~2#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9131: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~83#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774: havoc main_~node5__m5~64#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12568: havoc main_~node5____CPAchecker_TMP_1~53#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16004: havoc main_~node5____CPAchecker_TMP_1~72#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc main_~check__tmp~15#1;havoc main_~node5__m5~12#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7814: havoc main_~node5____CPAchecker_TMP_1~27#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3586: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~22#1;havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8079: havoc main_~node4__m4~16#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11515: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~109#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~63#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8874: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~80#1;havoc main_~node5____CPAchecker_TMP_0~33#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~19#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node4__m4~0#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5176: havoc main_~node4__m4~12#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7026: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1;havoc main_~node5____CPAchecker_TMP_0~23#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11254: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~106#1;havoc main_~node5____CPAchecker_TMP_0~46#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15747: havoc main_~node5__m5~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4384: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~31#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10198: havoc main_~node5____CPAchecker_TMP_1~40#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7557: havoc main_~node5__m5~41#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: havoc main_~check__tmp~11#1;havoc main_~node5__m5~8#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8351: havoc main_~node5____CPAchecker_TMP_1~30#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15486: havoc main_~node5____CPAchecker_TMP_1~69#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4123: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~28#1;havoc main_~node5____CPAchecker_TMP_0~7#1; [2025-03-16 19:28:22,559 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8616: havoc main_~node5__m5~47#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13638: havoc main_~node5____CPAchecker_TMP_1~59#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8089: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6769: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5448: havoc main_~node5____CPAchecker_TMP_1~14#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9941: havoc main_~node5__m5~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5713: havoc main_~node5__m5~31#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6507: havoc main_~node5____CPAchecker_TMP_1~20#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10735: havoc main_~node5____CPAchecker_TMP_1~43#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5186: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc main_~node5__m5~15#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3866: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~25#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: havoc main_~node5__m5~2#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9680: havoc main_~node5____CPAchecker_TMP_1~37#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13381: havoc main_~node5__m5~73#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-16 19:28:22,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8098: havoc main_~node5__m5~44#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6250: havoc main_~node5__m5~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10478: havoc main_~node5__m5~57#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1230: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node5__m5~0#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~node5__m5~28#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5989: havoc main_~node5____CPAchecker_TMP_1~17#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9425: havoc main_~node5____CPAchecker_TMP_1~36#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14447: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~141#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4936: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~37#1; [2025-03-16 19:28:22,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1765: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14186: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~138#1;havoc main_~node5____CPAchecker_TMP_0~62#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11015: havoc main_~node4__m4~20#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15245: havoc main_~main____CPAchecker_TMP_0~136#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~150#1;havoc main_~node5____CPAchecker_TMP_0~68#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4675: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~34#1;havoc main_~node5____CPAchecker_TMP_0~10#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9168: havoc main_~node5__m5~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3619: havoc main_~node5____CPAchecker_TMP_1~4#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13927: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14984: havoc main_~main____CPAchecker_TMP_0~133#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~147#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12342: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~118#1;havoc main_~node5____CPAchecker_TMP_0~52#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907: havoc main_~node5____CPAchecker_TMP_1~33#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7059: havoc main_~node5____CPAchecker_TMP_1~23#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11287: havoc main_~node5____CPAchecker_TMP_1~46#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11552: havoc main_~node5__m5~63#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:22,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12081: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~115#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11025: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3362: havoc main_~node5__m5~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13140: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~127#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~node5____CPAchecker_TMP_1~7#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14727: havoc main_~main____CPAchecker_TMP_0~130#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~144#1;havoc main_~node5____CPAchecker_TMP_0~65#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12879: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~124#1;havoc main_~node5____CPAchecker_TMP_0~55#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6802: havoc main_~node5__m5~37#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13937: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11824: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~112#1;havoc main_~node5____CPAchecker_TMP_0~49#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11034: havoc main_~node5__m5~60#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3899: havoc main_~node5__m5~21#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12622: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~121#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16058: havoc main_~main____CPAchecker_TMP_0~145#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~159#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7868: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~69#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2583: havoc main_~node5__m5~13#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13947: havoc main_~node4__m4~24#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15797: havoc main_~main____CPAchecker_TMP_0~142#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~156#1;havoc main_~node5____CPAchecker_TMP_0~71#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7607: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~66#1;havoc main_~node5____CPAchecker_TMP_0~26#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4436: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8666: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~78#1;havoc main_~node5____CPAchecker_TMP_0~32#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10252: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~95#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15540: havoc main_~main____CPAchecker_TMP_0~139#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~153#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7348: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8405: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~75#1; [2025-03-16 19:28:22,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14219: havoc main_~node5____CPAchecker_TMP_1~62#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5763: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~46#1;havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9991: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~92#1;havoc main_~node5____CPAchecker_TMP_0~39#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2328: havoc main_~check__tmp~13#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14484: havoc main_~node5__m5~79#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2064: havoc main_~node5__m5~9#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13692: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~133#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15278: havoc main_~node5____CPAchecker_TMP_1~68#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13957: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4708: havoc main_~node5____CPAchecker_TMP_1~10#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4973: havoc main_~node5__m5~27#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1538: havoc main_~check__tmp~7#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5502: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~43#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4446: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13431: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~130#1;havoc main_~node5____CPAchecker_TMP_0~58#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10789: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~101#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6561: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~55#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12375: havoc main_~node5____CPAchecker_TMP_1~52#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8148: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~72#1;havoc main_~node5____CPAchecker_TMP_0~29#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9734: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~89#1; [2025-03-16 19:28:22,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10528: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~98#1;havoc main_~node5____CPAchecker_TMP_0~42#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6300: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~52#1;havoc main_~node5____CPAchecker_TMP_0~19#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: 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-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15021: havoc main_~node5__m5~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7358: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809: havoc main_~check__tmp~9#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5245: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1;havoc main_~node5____CPAchecker_TMP_0~13#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13966: havoc main_~node5__m5~76#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14760: havoc main_~node5____CPAchecker_TMP_1~65#1; [2025-03-16 19:28:22,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12118: havoc main_~node5__m5~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4455: havoc main_~node5__m5~24#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12912: havoc main_~node5____CPAchecker_TMP_1~55#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~49#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11857: havoc main_~node5____CPAchecker_TMP_1~49#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9479: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~87#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1289: havoc main_~node5__m5~3#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7368: havoc main_~node4__m4~15#1; [2025-03-16 19:28:22,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9218: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~84#1;havoc main_~node5____CPAchecker_TMP_0~35#1; [2025-03-16 19:28:22,951 INFO L? ?]: Removed 1497 outVars from TransFormulas that were not future-live. [2025-03-16 19:28:22,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:28:23,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:28:23,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:28:23,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:23 BoogieIcfgContainer [2025-03-16 19:28:23,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:28:23,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:28:23,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:28:23,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:28:23,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:28:17" (1/3) ... [2025-03-16 19:28:23,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:23, skipping insertion in model container [2025-03-16 19:28:23,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:18" (2/3) ... [2025-03-16 19:28:23,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:23, skipping insertion in model container [2025-03-16 19:28:23,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:23" (3/3) ... [2025-03-16 19:28:23,015 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-16 19:28:23,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:28:23,031 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c that has 1 procedures, 1758 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-16 19:28:23,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:28:23,127 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;@b6ca0e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:28:23,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-16 19:28:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 1758 states, 1751 states have (on average 1.797829811536265) internal successors, (3148), 1757 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:28:23,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:23,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:23,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:23,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1677755534, now seen corresponding path program 1 times [2025-03-16 19:28:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487213299] [2025-03-16 19:28:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:23,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:28:23,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:28:23,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487213299] [2025-03-16 19:28:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487213299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149288073] [2025-03-16 19:28:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:23,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:23,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:23,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:23,738 INFO L87 Difference]: Start difference. First operand has 1758 states, 1751 states have (on average 1.797829811536265) internal successors, (3148), 1757 states have internal predecessors, (3148), 0 states have call successors, (0), 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 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:24,712 INFO L93 Difference]: Finished difference Result 2792 states and 4929 transitions. [2025-03-16 19:28:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:24,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:28:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:24,735 INFO L225 Difference]: With dead ends: 2792 [2025-03-16 19:28:24,736 INFO L226 Difference]: Without dead ends: 1531 [2025-03-16 19:28:24,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:24,748 INFO L435 NwaCegarLoop]: 1442 mSDtfsCounter, 7613 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7613 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:24,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7613 Valid, 1714 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:28:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-03-16 19:28:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1521. [2025-03-16 19:28:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1515 states have (on average 1.3676567656765677) internal successors, (2072), 1520 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2072 transitions. [2025-03-16 19:28:24,868 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2072 transitions. Word has length 75 [2025-03-16 19:28:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:24,869 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2072 transitions. [2025-03-16 19:28:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2072 transitions. [2025-03-16 19:28:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:28:24,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:24,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:28:24,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1874116370, now seen corresponding path program 1 times [2025-03-16 19:28:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668437483] [2025-03-16 19:28:24,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:24,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:24,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:28:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:28:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668437483] [2025-03-16 19:28:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668437483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:25,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835309099] [2025-03-16 19:28:25,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:25,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:25,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:25,085 INFO L87 Difference]: Start difference. First operand 1521 states and 2072 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:25,681 INFO L93 Difference]: Finished difference Result 2746 states and 3850 transitions. [2025-03-16 19:28:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:28:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:25,686 INFO L225 Difference]: With dead ends: 2746 [2025-03-16 19:28:25,687 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 19:28:25,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:25,689 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 4647 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:25,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 999 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 19:28:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1593. [2025-03-16 19:28:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1587 states have (on average 1.4120982986767485) internal successors, (2241), 1592 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2241 transitions. [2025-03-16 19:28:25,740 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2241 transitions. Word has length 76 [2025-03-16 19:28:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:25,741 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2241 transitions. [2025-03-16 19:28:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2241 transitions. [2025-03-16 19:28:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:25,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:25,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:28:25,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1670562582, now seen corresponding path program 1 times [2025-03-16 19:28:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762230004] [2025-03-16 19:28:25,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:25,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:25,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:25,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762230004] [2025-03-16 19:28:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762230004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991178381] [2025-03-16 19:28:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:25,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:25,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:25,845 INFO L87 Difference]: Start difference. First operand 1593 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:25,906 INFO L93 Difference]: Finished difference Result 2976 states and 4261 transitions. [2025-03-16 19:28:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:25,914 INFO L225 Difference]: With dead ends: 2976 [2025-03-16 19:28:25,915 INFO L226 Difference]: Without dead ends: 2264 [2025-03-16 19:28:25,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:25,919 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 1096 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:25,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 2716 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2025-03-16 19:28:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2252. [2025-03-16 19:28:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2246 states have (on average 1.4056099732858416) internal successors, (3157), 2251 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3157 transitions. [2025-03-16 19:28:25,989 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3157 transitions. Word has length 77 [2025-03-16 19:28:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:25,990 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3157 transitions. [2025-03-16 19:28:25,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3157 transitions. [2025-03-16 19:28:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:25,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:25,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:28:25,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1158753062, now seen corresponding path program 1 times [2025-03-16 19:28:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419833590] [2025-03-16 19:28:25,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:26,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:26,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:26,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:26,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:26,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:26,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419833590] [2025-03-16 19:28:26,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419833590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:26,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:26,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486669649] [2025-03-16 19:28:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:26,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:26,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:26,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,125 INFO L87 Difference]: Start difference. First operand 2252 states and 3157 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:26,251 INFO L93 Difference]: Finished difference Result 4356 states and 6178 transitions. [2025-03-16 19:28:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:26,262 INFO L225 Difference]: With dead ends: 4356 [2025-03-16 19:28:26,262 INFO L226 Difference]: Without dead ends: 3497 [2025-03-16 19:28:26,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,264 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 810 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:26,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2445 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2025-03-16 19:28:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3487. [2025-03-16 19:28:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3487 states, 3481 states have (on average 1.3927032461936226) internal successors, (4848), 3486 states have internal predecessors, (4848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 4848 transitions. [2025-03-16 19:28:26,324 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 4848 transitions. Word has length 77 [2025-03-16 19:28:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:26,324 INFO L471 AbstractCegarLoop]: Abstraction has 3487 states and 4848 transitions. [2025-03-16 19:28:26,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 4848 transitions. [2025-03-16 19:28:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:26,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:26,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:26,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:28:26,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1537862342, now seen corresponding path program 1 times [2025-03-16 19:28:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516444215] [2025-03-16 19:28:26,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:26,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:26,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:26,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516444215] [2025-03-16 19:28:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516444215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492649310] [2025-03-16 19:28:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:26,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,409 INFO L87 Difference]: Start difference. First operand 3487 states and 4848 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:26,480 INFO L93 Difference]: Finished difference Result 7168 states and 10233 transitions. [2025-03-16 19:28:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:26,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:26,496 INFO L225 Difference]: With dead ends: 7168 [2025-03-16 19:28:26,496 INFO L226 Difference]: Without dead ends: 5223 [2025-03-16 19:28:26,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,501 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 720 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:26,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2451 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2025-03-16 19:28:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 5213. [2025-03-16 19:28:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5213 states, 5207 states have (on average 1.4034952947954675) internal successors, (7308), 5212 states have internal predecessors, (7308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 7308 transitions. [2025-03-16 19:28:26,590 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 7308 transitions. Word has length 77 [2025-03-16 19:28:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 5213 states and 7308 transitions. [2025-03-16 19:28:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 7308 transitions. [2025-03-16 19:28:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:26,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:26,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, 1, 1, 1, 1] [2025-03-16 19:28:26,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:28:26,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1825250727, now seen corresponding path program 1 times [2025-03-16 19:28:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046251085] [2025-03-16 19:28:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:26,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:26,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:26,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:26,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046251085] [2025-03-16 19:28:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046251085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750356889] [2025-03-16 19:28:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:26,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,717 INFO L87 Difference]: Start difference. First operand 5213 states and 7308 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:26,777 INFO L93 Difference]: Finished difference Result 10576 states and 14995 transitions. [2025-03-16 19:28:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:26,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:26,799 INFO L225 Difference]: With dead ends: 10576 [2025-03-16 19:28:26,800 INFO L226 Difference]: Without dead ends: 7331 [2025-03-16 19:28:26,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:26,808 INFO L435 NwaCegarLoop]: 1782 mSDtfsCounter, 1115 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:26,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2724 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2025-03-16 19:28:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7309. [2025-03-16 19:28:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7309 states, 7303 states have (on average 1.3912090921539093) internal successors, (10160), 7308 states have internal predecessors, (10160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7309 states to 7309 states and 10160 transitions. [2025-03-16 19:28:26,989 INFO L78 Accepts]: Start accepts. Automaton has 7309 states and 10160 transitions. Word has length 77 [2025-03-16 19:28:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:26,989 INFO L471 AbstractCegarLoop]: Abstraction has 7309 states and 10160 transitions. [2025-03-16 19:28:26,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7309 states and 10160 transitions. [2025-03-16 19:28:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:26,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:26,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:26,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:28:26,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:26,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 556947885, now seen corresponding path program 1 times [2025-03-16 19:28:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269822955] [2025-03-16 19:28:26,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:27,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:27,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:27,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:27,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269822955] [2025-03-16 19:28:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269822955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738267061] [2025-03-16 19:28:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:27,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:27,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:27,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:27,085 INFO L87 Difference]: Start difference. First operand 7309 states and 10160 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:27,151 INFO L93 Difference]: Finished difference Result 16840 states and 23879 transitions. [2025-03-16 19:28:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:27,181 INFO L225 Difference]: With dead ends: 16840 [2025-03-16 19:28:27,181 INFO L226 Difference]: Without dead ends: 11315 [2025-03-16 19:28:27,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:27,193 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 719 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:27,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2344 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11315 states. [2025-03-16 19:28:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11315 to 11305. [2025-03-16 19:28:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11305 states, 11299 states have (on average 1.4001239047703335) internal successors, (15820), 11304 states have internal predecessors, (15820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11305 states to 11305 states and 15820 transitions. [2025-03-16 19:28:27,405 INFO L78 Accepts]: Start accepts. Automaton has 11305 states and 15820 transitions. Word has length 77 [2025-03-16 19:28:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:27,405 INFO L471 AbstractCegarLoop]: Abstraction has 11305 states and 15820 transitions. [2025-03-16 19:28:27,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11305 states and 15820 transitions. [2025-03-16 19:28:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:28:27,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:27,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:27,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:28:27,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:27,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash 453098747, now seen corresponding path program 1 times [2025-03-16 19:28:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:27,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287835572] [2025-03-16 19:28:27,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:27,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:28:27,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:28:27,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:27,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287835572] [2025-03-16 19:28:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287835572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241559308] [2025-03-16 19:28:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:27,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:27,543 INFO L87 Difference]: Start difference. First operand 11305 states and 15820 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:28,099 INFO L93 Difference]: Finished difference Result 24746 states and 34887 transitions. [2025-03-16 19:28:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:28:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:28,123 INFO L225 Difference]: With dead ends: 24746 [2025-03-16 19:28:28,123 INFO L226 Difference]: Without dead ends: 14407 [2025-03-16 19:28:28,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:28,137 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 3989 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:28,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 868 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2025-03-16 19:28:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 14361. [2025-03-16 19:28:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14361 states, 14355 states have (on average 1.4014629049111809) internal successors, (20118), 14360 states have internal predecessors, (20118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14361 states to 14361 states and 20118 transitions. [2025-03-16 19:28:28,362 INFO L78 Accepts]: Start accepts. Automaton has 14361 states and 20118 transitions. Word has length 77 [2025-03-16 19:28:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:28,363 INFO L471 AbstractCegarLoop]: Abstraction has 14361 states and 20118 transitions. [2025-03-16 19:28:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 14361 states and 20118 transitions. [2025-03-16 19:28:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:28,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:28,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:28:28,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1107262701, now seen corresponding path program 1 times [2025-03-16 19:28:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172773022] [2025-03-16 19:28:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:28,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:28,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:28,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:28,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172773022] [2025-03-16 19:28:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172773022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:28,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503126643] [2025-03-16 19:28:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:28,549 INFO L87 Difference]: Start difference. First operand 14361 states and 20118 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:29,433 INFO L93 Difference]: Finished difference Result 35909 states and 50975 transitions. [2025-03-16 19:28:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:29,481 INFO L225 Difference]: With dead ends: 35909 [2025-03-16 19:28:29,481 INFO L226 Difference]: Without dead ends: 30137 [2025-03-16 19:28:29,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:29,494 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 5121 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:29,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 1740 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30137 states. [2025-03-16 19:28:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30137 to 14541. [2025-03-16 19:28:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14541 states, 14535 states have (on average 1.4006191950464397) internal successors, (20358), 14540 states have internal predecessors, (20358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 20358 transitions. [2025-03-16 19:28:29,863 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 20358 transitions. Word has length 78 [2025-03-16 19:28:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 14541 states and 20358 transitions. [2025-03-16 19:28:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 20358 transitions. [2025-03-16 19:28:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:29,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:29,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:29,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:28:29,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -253677514, now seen corresponding path program 1 times [2025-03-16 19:28:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134190200] [2025-03-16 19:28:29,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:29,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:29,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:29,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:29,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134190200] [2025-03-16 19:28:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134190200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:30,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633599418] [2025-03-16 19:28:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:30,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:30,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:30,061 INFO L87 Difference]: Start difference. First operand 14541 states and 20358 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:30,968 INFO L93 Difference]: Finished difference Result 33563 states and 47534 transitions. [2025-03-16 19:28:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:31,011 INFO L225 Difference]: With dead ends: 33563 [2025-03-16 19:28:31,011 INFO L226 Difference]: Without dead ends: 28085 [2025-03-16 19:28:31,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:31,025 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 5076 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5076 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:31,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5076 Valid, 1715 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28085 states. [2025-03-16 19:28:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28085 to 14829. [2025-03-16 19:28:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14829 states, 14823 states have (on average 1.3995817310935708) internal successors, (20746), 14828 states have internal predecessors, (20746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14829 states to 14829 states and 20746 transitions. [2025-03-16 19:28:31,327 INFO L78 Accepts]: Start accepts. Automaton has 14829 states and 20746 transitions. Word has length 78 [2025-03-16 19:28:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:31,327 INFO L471 AbstractCegarLoop]: Abstraction has 14829 states and 20746 transitions. [2025-03-16 19:28:31,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14829 states and 20746 transitions. [2025-03-16 19:28:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:31,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:31,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:31,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:28:31,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:31,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2144105533, now seen corresponding path program 1 times [2025-03-16 19:28:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808891782] [2025-03-16 19:28:31,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:31,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:31,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:31,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808891782] [2025-03-16 19:28:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808891782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008559134] [2025-03-16 19:28:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:31,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:31,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:31,476 INFO L87 Difference]: Start difference. First operand 14829 states and 20746 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:32,228 INFO L93 Difference]: Finished difference Result 31263 states and 44280 transitions. [2025-03-16 19:28:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:32,262 INFO L225 Difference]: With dead ends: 31263 [2025-03-16 19:28:32,262 INFO L226 Difference]: Without dead ends: 26773 [2025-03-16 19:28:32,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:32,275 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 5221 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:32,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 1771 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26773 states. [2025-03-16 19:28:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26773 to 14889. [2025-03-16 19:28:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14889 states, 14883 states have (on average 1.399314654303568) internal successors, (20826), 14888 states have internal predecessors, (20826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14889 states to 14889 states and 20826 transitions. [2025-03-16 19:28:32,563 INFO L78 Accepts]: Start accepts. Automaton has 14889 states and 20826 transitions. Word has length 78 [2025-03-16 19:28:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 14889 states and 20826 transitions. [2025-03-16 19:28:32,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14889 states and 20826 transitions. [2025-03-16 19:28:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:32,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:32,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:28:32,574 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 41293013, now seen corresponding path program 1 times [2025-03-16 19:28:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226106060] [2025-03-16 19:28:32,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:32,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:32,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226106060] [2025-03-16 19:28:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226106060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302456689] [2025-03-16 19:28:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:32,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:32,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:32,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:32,822 INFO L87 Difference]: Start difference. First operand 14889 states and 20826 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:32,935 INFO L93 Difference]: Finished difference Result 14889 states and 20826 transitions. [2025-03-16 19:28:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:32,950 INFO L225 Difference]: With dead ends: 14889 [2025-03-16 19:28:32,950 INFO L226 Difference]: Without dead ends: 14887 [2025-03-16 19:28:32,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:32,954 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 0 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:32,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3492 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14887 states. [2025-03-16 19:28:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14887 to 14887. [2025-03-16 19:28:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14887 states, 14882 states have (on average 1.3969224566590512) internal successors, (20789), 14886 states have internal predecessors, (20789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 20789 transitions. [2025-03-16 19:28:33,099 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 20789 transitions. Word has length 79 [2025-03-16 19:28:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:33,099 INFO L471 AbstractCegarLoop]: Abstraction has 14887 states and 20789 transitions. [2025-03-16 19:28:33,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 20789 transitions. [2025-03-16 19:28:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:33,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:33,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:33,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:28:33,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:33,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2137408806, now seen corresponding path program 1 times [2025-03-16 19:28:33,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:33,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210106210] [2025-03-16 19:28:33,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:33,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:33,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:33,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:33,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210106210] [2025-03-16 19:28:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210106210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446874511] [2025-03-16 19:28:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:33,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:33,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:33,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:33,201 INFO L87 Difference]: Start difference. First operand 14887 states and 20789 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:33,772 INFO L93 Difference]: Finished difference Result 33339 states and 46552 transitions. [2025-03-16 19:28:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:33,842 INFO L225 Difference]: With dead ends: 33339 [2025-03-16 19:28:33,842 INFO L226 Difference]: Without dead ends: 19256 [2025-03-16 19:28:33,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:33,848 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 3641 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3641 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:33,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3641 Valid, 785 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19256 states. [2025-03-16 19:28:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19256 to 19194. [2025-03-16 19:28:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19189 states have (on average 1.3842826619417374) internal successors, (26563), 19193 states have internal predecessors, (26563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 26563 transitions. [2025-03-16 19:28:34,080 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 26563 transitions. Word has length 79 [2025-03-16 19:28:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:34,080 INFO L471 AbstractCegarLoop]: Abstraction has 19194 states and 26563 transitions. [2025-03-16 19:28:34,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 26563 transitions. [2025-03-16 19:28:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:34,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:34,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:34,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:28:34,090 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:34,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 303676529, now seen corresponding path program 1 times [2025-03-16 19:28:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862305716] [2025-03-16 19:28:34,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:34,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:34,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:34,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862305716] [2025-03-16 19:28:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862305716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014295243] [2025-03-16 19:28:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:34,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:34,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:34,364 INFO L87 Difference]: Start difference. First operand 19194 states and 26563 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:34,463 INFO L93 Difference]: Finished difference Result 19194 states and 26563 transitions. [2025-03-16 19:28:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:34,484 INFO L225 Difference]: With dead ends: 19194 [2025-03-16 19:28:34,484 INFO L226 Difference]: Without dead ends: 19192 [2025-03-16 19:28:34,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:34,490 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 0 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:34,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3339 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19192 states. [2025-03-16 19:28:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19192 to 19192. [2025-03-16 19:28:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19192 states, 19188 states have (on average 1.381488430268918) internal successors, (26508), 19191 states have internal predecessors, (26508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19192 states to 19192 states and 26508 transitions. [2025-03-16 19:28:34,758 INFO L78 Accepts]: Start accepts. Automaton has 19192 states and 26508 transitions. Word has length 79 [2025-03-16 19:28:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 19192 states and 26508 transitions. [2025-03-16 19:28:34,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-03-16 19:28:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19192 states and 26508 transitions. [2025-03-16 19:28:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:34,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:34,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:34,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:28:34,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:34,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -829748144, now seen corresponding path program 1 times [2025-03-16 19:28:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045483948] [2025-03-16 19:28:34,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:34,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:34,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:34,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045483948] [2025-03-16 19:28:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045483948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794311813] [2025-03-16 19:28:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:34,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:34,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:34,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:34,912 INFO L87 Difference]: Start difference. First operand 19192 states and 26508 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:35,466 INFO L93 Difference]: Finished difference Result 44671 states and 61915 transitions. [2025-03-16 19:28:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:35,497 INFO L225 Difference]: With dead ends: 44671 [2025-03-16 19:28:35,498 INFO L226 Difference]: Without dead ends: 26350 [2025-03-16 19:28:35,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:35,520 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 4001 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:35,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 912 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26350 states. [2025-03-16 19:28:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26350 to 19192. [2025-03-16 19:28:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19192 states, 19188 states have (on average 1.3772149259954138) internal successors, (26426), 19191 states have internal predecessors, (26426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19192 states to 19192 states and 26426 transitions. [2025-03-16 19:28:35,804 INFO L78 Accepts]: Start accepts. Automaton has 19192 states and 26426 transitions. Word has length 79 [2025-03-16 19:28:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 19192 states and 26426 transitions. [2025-03-16 19:28:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-03-16 19:28:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19192 states and 26426 transitions. [2025-03-16 19:28:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:35,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:35,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:28:35,814 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash -258597270, now seen corresponding path program 1 times [2025-03-16 19:28:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648841588] [2025-03-16 19:28:35,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:35,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:35,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:35,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648841588] [2025-03-16 19:28:35,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648841588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:35,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:35,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594503755] [2025-03-16 19:28:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:35,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:35,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:35,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:35,956 INFO L87 Difference]: Start difference. First operand 19192 states and 26426 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:36,799 INFO L93 Difference]: Finished difference Result 43504 states and 60350 transitions. [2025-03-16 19:28:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:28:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:36,834 INFO L225 Difference]: With dead ends: 43504 [2025-03-16 19:28:36,834 INFO L226 Difference]: Without dead ends: 35814 [2025-03-16 19:28:36,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:36,849 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 4811 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4811 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:36,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4811 Valid, 1687 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:28:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35814 states. [2025-03-16 19:28:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35814 to 19699. [2025-03-16 19:28:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19699 states, 19695 states have (on average 1.3765930439197767) internal successors, (27112), 19698 states have internal predecessors, (27112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19699 states to 19699 states and 27112 transitions. [2025-03-16 19:28:37,205 INFO L78 Accepts]: Start accepts. Automaton has 19699 states and 27112 transitions. Word has length 80 [2025-03-16 19:28:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 19699 states and 27112 transitions. [2025-03-16 19:28:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19699 states and 27112 transitions. [2025-03-16 19:28:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:37,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:37,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:28:37,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2042121634, now seen corresponding path program 1 times [2025-03-16 19:28:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667083503] [2025-03-16 19:28:37,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:37,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:37,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:37,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:37,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667083503] [2025-03-16 19:28:37,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667083503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:37,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936695936] [2025-03-16 19:28:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:37,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:37,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:37,327 INFO L87 Difference]: Start difference. First operand 19699 states and 27112 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:37,951 INFO L93 Difference]: Finished difference Result 40515 states and 56053 transitions. [2025-03-16 19:28:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:28:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:37,984 INFO L225 Difference]: With dead ends: 40515 [2025-03-16 19:28:37,985 INFO L226 Difference]: Without dead ends: 31131 [2025-03-16 19:28:38,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:38,001 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 4609 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:38,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 1606 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31131 states. [2025-03-16 19:28:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31131 to 19783. [2025-03-16 19:28:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19783 states, 19779 states have (on average 1.3762070883260022) internal successors, (27220), 19782 states have internal predecessors, (27220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 27220 transitions. [2025-03-16 19:28:38,276 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 27220 transitions. Word has length 80 [2025-03-16 19:28:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:38,276 INFO L471 AbstractCegarLoop]: Abstraction has 19783 states and 27220 transitions. [2025-03-16 19:28:38,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 27220 transitions. [2025-03-16 19:28:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:38,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:38,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:28:38,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1648623017, now seen corresponding path program 1 times [2025-03-16 19:28:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967520656] [2025-03-16 19:28:38,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:38,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:38,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967520656] [2025-03-16 19:28:38,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967520656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:38,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:38,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371262295] [2025-03-16 19:28:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:38,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:38,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:38,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:38,473 INFO L87 Difference]: Start difference. First operand 19783 states and 27220 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:38,566 INFO L93 Difference]: Finished difference Result 19783 states and 27220 transitions. [2025-03-16 19:28:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:38,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:28:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:38,654 INFO L225 Difference]: With dead ends: 19783 [2025-03-16 19:28:38,654 INFO L226 Difference]: Without dead ends: 19781 [2025-03-16 19:28:38,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:38,658 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 0 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:38,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3327 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19781 states. [2025-03-16 19:28:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19781 to 19781. [2025-03-16 19:28:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19781 states, 19778 states have (on average 1.3734958034179392) internal successors, (27165), 19780 states have internal predecessors, (27165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19781 states to 19781 states and 27165 transitions. [2025-03-16 19:28:38,842 INFO L78 Accepts]: Start accepts. Automaton has 19781 states and 27165 transitions. Word has length 81 [2025-03-16 19:28:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:38,842 INFO L471 AbstractCegarLoop]: Abstraction has 19781 states and 27165 transitions. [2025-03-16 19:28:38,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19781 states and 27165 transitions. [2025-03-16 19:28:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:38,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:38,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:28:38,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 704808878, now seen corresponding path program 1 times [2025-03-16 19:28:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549887] [2025-03-16 19:28:38,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:38,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:38,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549887] [2025-03-16 19:28:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491875359] [2025-03-16 19:28:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:39,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:39,021 INFO L87 Difference]: Start difference. First operand 19781 states and 27165 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,117 INFO L93 Difference]: Finished difference Result 19781 states and 27165 transitions. [2025-03-16 19:28:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:39,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:28:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,139 INFO L225 Difference]: With dead ends: 19781 [2025-03-16 19:28:39,139 INFO L226 Difference]: Without dead ends: 19779 [2025-03-16 19:28:39,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:39,146 INFO L435 NwaCegarLoop]: 1126 mSDtfsCounter, 0 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3321 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19779 states. [2025-03-16 19:28:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19779 to 19779. [2025-03-16 19:28:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19779 states, 19777 states have (on average 1.370784244324215) internal successors, (27110), 19778 states have internal predecessors, (27110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19779 states to 19779 states and 27110 transitions. [2025-03-16 19:28:39,351 INFO L78 Accepts]: Start accepts. Automaton has 19779 states and 27110 transitions. Word has length 81 [2025-03-16 19:28:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:39,351 INFO L471 AbstractCegarLoop]: Abstraction has 19779 states and 27110 transitions. [2025-03-16 19:28:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19779 states and 27110 transitions. [2025-03-16 19:28:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:39,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:39,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:39,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:28:39,360 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:39,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1904550428, now seen corresponding path program 1 times [2025-03-16 19:28:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:39,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100823260] [2025-03-16 19:28:39,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:39,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100823260] [2025-03-16 19:28:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100823260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896710121] [2025-03-16 19:28:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:39,526 INFO L87 Difference]: Start difference. First operand 19779 states and 27110 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,620 INFO L93 Difference]: Finished difference Result 19779 states and 27110 transitions. [2025-03-16 19:28:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:28:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,641 INFO L225 Difference]: With dead ends: 19779 [2025-03-16 19:28:39,641 INFO L226 Difference]: Without dead ends: 19777 [2025-03-16 19:28:39,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:39,650 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 0 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3315 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19777 states. [2025-03-16 19:28:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19777 to 19777. [2025-03-16 19:28:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19777 states, 19776 states have (on average 1.3667071197411003) internal successors, (27028), 19776 states have internal predecessors, (27028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19777 states to 19777 states and 27028 transitions. [2025-03-16 19:28:39,977 INFO L78 Accepts]: Start accepts. Automaton has 19777 states and 27028 transitions. Word has length 83 [2025-03-16 19:28:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:39,977 INFO L471 AbstractCegarLoop]: Abstraction has 19777 states and 27028 transitions. [2025-03-16 19:28:39,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19777 states and 27028 transitions. [2025-03-16 19:28:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:39,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:39,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:39,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:28:39,989 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2100658446, now seen corresponding path program 1 times [2025-03-16 19:28:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509056698] [2025-03-16 19:28:39,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:40,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:40,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:40,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509056698] [2025-03-16 19:28:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509056698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555495824] [2025-03-16 19:28:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:40,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:40,278 INFO L87 Difference]: Start difference. First operand 19777 states and 27028 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:41,384 INFO L93 Difference]: Finished difference Result 32356 states and 44381 transitions. [2025-03-16 19:28:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:41,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:41,412 INFO L225 Difference]: With dead ends: 32356 [2025-03-16 19:28:41,412 INFO L226 Difference]: Without dead ends: 28439 [2025-03-16 19:28:41,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:28:41,424 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 2406 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:41,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 3177 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:28:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28439 states. [2025-03-16 19:28:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28439 to 19781. [2025-03-16 19:28:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19781 states, 19780 states have (on average 1.3665824064711831) internal successors, (27031), 19780 states have internal predecessors, (27031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19781 states to 19781 states and 27031 transitions. [2025-03-16 19:28:41,689 INFO L78 Accepts]: Start accepts. Automaton has 19781 states and 27031 transitions. Word has length 84 [2025-03-16 19:28:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 19781 states and 27031 transitions. [2025-03-16 19:28:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19781 states and 27031 transitions. [2025-03-16 19:28:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:41,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:41,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:41,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:28:41,702 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1147844510, now seen corresponding path program 1 times [2025-03-16 19:28:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252882347] [2025-03-16 19:28:41,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:41,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:41,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:41,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:41,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252882347] [2025-03-16 19:28:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252882347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:41,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102107337] [2025-03-16 19:28:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:41,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:41,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:41,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:41,909 INFO L87 Difference]: Start difference. First operand 19781 states and 27031 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,855 INFO L93 Difference]: Finished difference Result 40231 states and 55798 transitions. [2025-03-16 19:28:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,887 INFO L225 Difference]: With dead ends: 40231 [2025-03-16 19:28:42,887 INFO L226 Difference]: Without dead ends: 29039 [2025-03-16 19:28:42,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:28:42,902 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 4225 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 2829 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29039 states. [2025-03-16 19:28:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29039 to 19775. [2025-03-16 19:28:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19775 states, 19774 states have (on average 1.3660867806210175) internal successors, (27013), 19774 states have internal predecessors, (27013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19775 states to 19775 states and 27013 transitions. [2025-03-16 19:28:43,189 INFO L78 Accepts]: Start accepts. Automaton has 19775 states and 27013 transitions. Word has length 84 [2025-03-16 19:28:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:43,189 INFO L471 AbstractCegarLoop]: Abstraction has 19775 states and 27013 transitions. [2025-03-16 19:28:43,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19775 states and 27013 transitions. [2025-03-16 19:28:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:43,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:43,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:43,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:28:43,198 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:43,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1735477083, now seen corresponding path program 1 times [2025-03-16 19:28:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47112231] [2025-03-16 19:28:43,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:43,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:43,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:43,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47112231] [2025-03-16 19:28:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47112231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:43,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:43,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:43,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597441328] [2025-03-16 19:28:43,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:43,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:43,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:43,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:43,317 INFO L87 Difference]: Start difference. First operand 19775 states and 27013 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:44,272 INFO L93 Difference]: Finished difference Result 43397 states and 59995 transitions. [2025-03-16 19:28:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:44,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:44,310 INFO L225 Difference]: With dead ends: 43397 [2025-03-16 19:28:44,310 INFO L226 Difference]: Without dead ends: 35925 [2025-03-16 19:28:44,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:44,326 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 4779 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:44,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 1675 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35925 states. [2025-03-16 19:28:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35925 to 19865. [2025-03-16 19:28:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19865 states, 19864 states have (on average 1.365938380990737) internal successors, (27133), 19864 states have internal predecessors, (27133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19865 states to 19865 states and 27133 transitions. [2025-03-16 19:28:44,669 INFO L78 Accepts]: Start accepts. Automaton has 19865 states and 27133 transitions. Word has length 84 [2025-03-16 19:28:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:44,669 INFO L471 AbstractCegarLoop]: Abstraction has 19865 states and 27133 transitions. [2025-03-16 19:28:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19865 states and 27133 transitions. [2025-03-16 19:28:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:44,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:44,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:44,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:28:44,678 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1381351712, now seen corresponding path program 1 times [2025-03-16 19:28:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876657544] [2025-03-16 19:28:44,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:44,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:44,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:44,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876657544] [2025-03-16 19:28:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876657544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903525255] [2025-03-16 19:28:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:44,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:44,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:44,888 INFO L87 Difference]: Start difference. First operand 19865 states and 27133 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:45,837 INFO L93 Difference]: Finished difference Result 40960 states and 56831 transitions. [2025-03-16 19:28:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:28:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:45,871 INFO L225 Difference]: With dead ends: 40960 [2025-03-16 19:28:45,871 INFO L226 Difference]: Without dead ends: 29712 [2025-03-16 19:28:45,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:28:45,886 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 3634 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3634 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:45,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3634 Valid, 3130 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:28:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29712 states. [2025-03-16 19:28:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29712 to 19831. [2025-03-16 19:28:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19831 states, 19830 states have (on average 1.3656580937972769) internal successors, (27081), 19830 states have internal predecessors, (27081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19831 states to 19831 states and 27081 transitions. [2025-03-16 19:28:46,171 INFO L78 Accepts]: Start accepts. Automaton has 19831 states and 27081 transitions. Word has length 84 [2025-03-16 19:28:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:46,171 INFO L471 AbstractCegarLoop]: Abstraction has 19831 states and 27081 transitions. [2025-03-16 19:28:46,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 19831 states and 27081 transitions. [2025-03-16 19:28:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:46,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:46,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:28:46,180 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 855113599, now seen corresponding path program 1 times [2025-03-16 19:28:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021894697] [2025-03-16 19:28:46,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:46,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:46,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:46,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:46,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021894697] [2025-03-16 19:28:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021894697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635562406] [2025-03-16 19:28:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:46,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:46,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:46,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:46,309 INFO L87 Difference]: Start difference. First operand 19831 states and 27081 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:47,029 INFO L93 Difference]: Finished difference Result 46935 states and 65168 transitions. [2025-03-16 19:28:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:28:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:47,073 INFO L225 Difference]: With dead ends: 46935 [2025-03-16 19:28:47,073 INFO L226 Difference]: Without dead ends: 39371 [2025-03-16 19:28:47,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:47,091 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 4831 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:47,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 1695 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39371 states. [2025-03-16 19:28:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39371 to 19891. [2025-03-16 19:28:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19891 states, 19890 states have (on average 1.365560583207642) internal successors, (27161), 19890 states have internal predecessors, (27161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19891 states to 19891 states and 27161 transitions. [2025-03-16 19:28:47,645 INFO L78 Accepts]: Start accepts. Automaton has 19891 states and 27161 transitions. Word has length 84 [2025-03-16 19:28:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:47,645 INFO L471 AbstractCegarLoop]: Abstraction has 19891 states and 27161 transitions. [2025-03-16 19:28:47,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19891 states and 27161 transitions. [2025-03-16 19:28:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:47,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:47,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:47,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:28:47,653 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1193382763, now seen corresponding path program 1 times [2025-03-16 19:28:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276831196] [2025-03-16 19:28:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:47,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:47,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:47,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276831196] [2025-03-16 19:28:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276831196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:28:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217187517] [2025-03-16 19:28:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:28:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:28:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:28:48,225 INFO L87 Difference]: Start difference. First operand 19891 states and 27161 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:49,888 INFO L93 Difference]: Finished difference Result 63582 states and 88667 transitions. [2025-03-16 19:28:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:28:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:49,943 INFO L225 Difference]: With dead ends: 63582 [2025-03-16 19:28:49,943 INFO L226 Difference]: Without dead ends: 52384 [2025-03-16 19:28:49,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:28:49,960 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 6125 mSDsluCounter, 5661 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6125 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:49,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6125 Valid, 6614 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:28:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52384 states. [2025-03-16 19:28:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52384 to 19873. [2025-03-16 19:28:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19873 states, 19872 states have (on average 1.3649859098228663) internal successors, (27125), 19872 states have internal predecessors, (27125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19873 states to 19873 states and 27125 transitions. [2025-03-16 19:28:50,304 INFO L78 Accepts]: Start accepts. Automaton has 19873 states and 27125 transitions. Word has length 85 [2025-03-16 19:28:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,305 INFO L471 AbstractCegarLoop]: Abstraction has 19873 states and 27125 transitions. [2025-03-16 19:28:50,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 19873 states and 27125 transitions. [2025-03-16 19:28:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:50,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:28:50,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash 221391005, now seen corresponding path program 1 times [2025-03-16 19:28:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358965580] [2025-03-16 19:28:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:50,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358965580] [2025-03-16 19:28:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358965580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:28:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065751791] [2025-03-16 19:28:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:28:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:28:50,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:50,944 INFO L87 Difference]: Start difference. First operand 19873 states and 27125 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:51,694 INFO L93 Difference]: Finished difference Result 44304 states and 61677 transitions. [2025-03-16 19:28:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:51,729 INFO L225 Difference]: With dead ends: 44304 [2025-03-16 19:28:51,729 INFO L226 Difference]: Without dead ends: 33058 [2025-03-16 19:28:51,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:28:51,744 INFO L435 NwaCegarLoop]: 1025 mSDtfsCounter, 6571 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6571 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:51,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6571 Valid, 4431 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33058 states. [2025-03-16 19:28:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33058 to 19807. [2025-03-16 19:28:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19807 states, 19806 states have (on average 1.3646874684439059) internal successors, (27029), 19806 states have internal predecessors, (27029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19807 states to 19807 states and 27029 transitions. [2025-03-16 19:28:52,033 INFO L78 Accepts]: Start accepts. Automaton has 19807 states and 27029 transitions. Word has length 85 [2025-03-16 19:28:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:52,033 INFO L471 AbstractCegarLoop]: Abstraction has 19807 states and 27029 transitions. [2025-03-16 19:28:52,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19807 states and 27029 transitions. [2025-03-16 19:28:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:52,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:52,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:28:52,042 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:52,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash 676512880, now seen corresponding path program 1 times [2025-03-16 19:28:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60005274] [2025-03-16 19:28:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:52,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:52,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:52,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:52,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60005274] [2025-03-16 19:28:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60005274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953370304] [2025-03-16 19:28:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:52,278 INFO L87 Difference]: Start difference. First operand 19807 states and 27029 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:53,629 INFO L93 Difference]: Finished difference Result 34477 states and 47340 transitions. [2025-03-16 19:28:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:28:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:53,657 INFO L225 Difference]: With dead ends: 34477 [2025-03-16 19:28:53,657 INFO L226 Difference]: Without dead ends: 28447 [2025-03-16 19:28:53,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:28:53,670 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 3228 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:53,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 3400 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:28:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28447 states. [2025-03-16 19:28:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28447 to 19803. [2025-03-16 19:28:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19803 states, 19802 states have (on average 1.3645591354408646) internal successors, (27021), 19802 states have internal predecessors, (27021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19803 states to 19803 states and 27021 transitions. [2025-03-16 19:28:54,022 INFO L78 Accepts]: Start accepts. Automaton has 19803 states and 27021 transitions. Word has length 85 [2025-03-16 19:28:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 19803 states and 27021 transitions. [2025-03-16 19:28:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19803 states and 27021 transitions. [2025-03-16 19:28:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:54,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:54,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:54,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:28:54,032 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2009192174, now seen corresponding path program 1 times [2025-03-16 19:28:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183295008] [2025-03-16 19:28:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:54,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183295008] [2025-03-16 19:28:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183295008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799574586] [2025-03-16 19:28:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:54,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:54,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:54,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:54,152 INFO L87 Difference]: Start difference. First operand 19803 states and 27021 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:54,949 INFO L93 Difference]: Finished difference Result 43447 states and 60045 transitions. [2025-03-16 19:28:54,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:28:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:54,990 INFO L225 Difference]: With dead ends: 43447 [2025-03-16 19:28:54,991 INFO L226 Difference]: Without dead ends: 35939 [2025-03-16 19:28:55,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:28:55,008 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 4723 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4723 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:55,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4723 Valid, 1665 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35939 states. [2025-03-16 19:28:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35939 to 19998. [2025-03-16 19:28:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19998 states, 19997 states have (on average 1.3645046757013553) internal successors, (27286), 19997 states have internal predecessors, (27286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19998 states to 19998 states and 27286 transitions. [2025-03-16 19:28:55,430 INFO L78 Accepts]: Start accepts. Automaton has 19998 states and 27286 transitions. Word has length 85 [2025-03-16 19:28:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:55,430 INFO L471 AbstractCegarLoop]: Abstraction has 19998 states and 27286 transitions. [2025-03-16 19:28:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19998 states and 27286 transitions. [2025-03-16 19:28:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:55,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:55,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:55,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:28:55,439 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1061278996, now seen corresponding path program 1 times [2025-03-16 19:28:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938485010] [2025-03-16 19:28:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:55,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:55,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:55,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938485010] [2025-03-16 19:28:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938485010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:55,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070140059] [2025-03-16 19:28:55,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:55,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:55,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:55,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:55,586 INFO L87 Difference]: Start difference. First operand 19998 states and 27286 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:56,393 INFO L93 Difference]: Finished difference Result 41274 states and 57247 transitions. [2025-03-16 19:28:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:56,424 INFO L225 Difference]: With dead ends: 41274 [2025-03-16 19:28:56,424 INFO L226 Difference]: Without dead ends: 29634 [2025-03-16 19:28:56,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:28:56,439 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 2811 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:56,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 2682 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29634 states. [2025-03-16 19:28:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29634 to 19756. [2025-03-16 19:28:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19756 states, 19755 states have (on average 1.3645153125790939) internal successors, (26956), 19755 states have internal predecessors, (26956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19756 states to 19756 states and 26956 transitions. [2025-03-16 19:28:56,693 INFO L78 Accepts]: Start accepts. Automaton has 19756 states and 26956 transitions. Word has length 85 [2025-03-16 19:28:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 19756 states and 26956 transitions. [2025-03-16 19:28:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19756 states and 26956 transitions. [2025-03-16 19:28:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:56,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:56,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:28:56,702 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1365526482, now seen corresponding path program 1 times [2025-03-16 19:28:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:56,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790156180] [2025-03-16 19:28:56,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:56,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:56,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:56,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:56,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790156180] [2025-03-16 19:28:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790156180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:57,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:28:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134559848] [2025-03-16 19:28:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:57,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:28:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:57,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:28:57,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:28:57,112 INFO L87 Difference]: Start difference. First operand 19756 states and 26956 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:57,983 INFO L93 Difference]: Finished difference Result 70780 states and 98884 transitions. [2025-03-16 19:28:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:28:57,984 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:28:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:58,136 INFO L225 Difference]: With dead ends: 70780 [2025-03-16 19:28:58,137 INFO L226 Difference]: Without dead ends: 58926 [2025-03-16 19:28:58,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:28:58,151 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 8048 mSDsluCounter, 5753 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8048 SdHoareTripleChecker+Valid, 6724 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:58,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8048 Valid, 6724 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:28:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58926 states. [2025-03-16 19:28:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58926 to 19070. [2025-03-16 19:28:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19070 states, 19069 states have (on average 1.3661964444910588) internal successors, (26052), 19069 states have internal predecessors, (26052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19070 states to 19070 states and 26052 transitions. [2025-03-16 19:28:58,486 INFO L78 Accepts]: Start accepts. Automaton has 19070 states and 26052 transitions. Word has length 85 [2025-03-16 19:28:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:58,486 INFO L471 AbstractCegarLoop]: Abstraction has 19070 states and 26052 transitions. [2025-03-16 19:28:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19070 states and 26052 transitions. [2025-03-16 19:28:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:28:58,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:58,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:58,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:28:58,494 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:58,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 319963233, now seen corresponding path program 1 times [2025-03-16 19:28:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036297383] [2025-03-16 19:28:58,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:28:58,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:28:58,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:58,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036297383] [2025-03-16 19:28:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036297383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:58,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:58,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616408257] [2025-03-16 19:28:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:58,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:28:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:58,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:28:58,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:28:58,673 INFO L87 Difference]: Start difference. First operand 19070 states and 26052 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:59,450 INFO L93 Difference]: Finished difference Result 40068 states and 55616 transitions. [2025-03-16 19:28:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:28:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:28:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:59,481 INFO L225 Difference]: With dead ends: 40068 [2025-03-16 19:28:59,481 INFO L226 Difference]: Without dead ends: 28564 [2025-03-16 19:28:59,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:28:59,496 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 3336 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:59,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 2816 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:28:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28564 states. [2025-03-16 19:28:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28564 to 18890. [2025-03-16 19:28:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18890 states, 18889 states have (on average 1.3658743183863624) internal successors, (25800), 18889 states have internal predecessors, (25800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18890 states to 18890 states and 25800 transitions. [2025-03-16 19:28:59,779 INFO L78 Accepts]: Start accepts. Automaton has 18890 states and 25800 transitions. Word has length 86 [2025-03-16 19:28:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 18890 states and 25800 transitions. [2025-03-16 19:28:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 18890 states and 25800 transitions. [2025-03-16 19:28:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:28:59,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:59,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:59,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:28:59,788 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:28:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1016109718, now seen corresponding path program 1 times [2025-03-16 19:28:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436334199] [2025-03-16 19:28:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:59,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:28:59,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:28:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436334199] [2025-03-16 19:28:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436334199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:59,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:59,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:28:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941576270] [2025-03-16 19:28:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:59,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:59,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:59,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:59,882 INFO L87 Difference]: Start difference. First operand 18890 states and 25800 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:00,476 INFO L93 Difference]: Finished difference Result 49912 states and 69565 transitions. [2025-03-16 19:29:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:00,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:29:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:00,521 INFO L225 Difference]: With dead ends: 49912 [2025-03-16 19:29:00,522 INFO L226 Difference]: Without dead ends: 42088 [2025-03-16 19:29:00,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:00,539 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4498 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4498 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:00,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4498 Valid, 1604 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42088 states. [2025-03-16 19:29:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42088 to 18965. [2025-03-16 19:29:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18965 states, 18964 states have (on average 1.3657456232862266) internal successors, (25900), 18964 states have internal predecessors, (25900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18965 states to 18965 states and 25900 transitions. [2025-03-16 19:29:00,913 INFO L78 Accepts]: Start accepts. Automaton has 18965 states and 25900 transitions. Word has length 86 [2025-03-16 19:29:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:00,913 INFO L471 AbstractCegarLoop]: Abstraction has 18965 states and 25900 transitions. [2025-03-16 19:29:00,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 18965 states and 25900 transitions. [2025-03-16 19:29:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:29:00,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:00,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:00,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:29:00,922 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash -268650917, now seen corresponding path program 1 times [2025-03-16 19:29:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539253444] [2025-03-16 19:29:00,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:00,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:29:00,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:29:00,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:00,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539253444] [2025-03-16 19:29:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539253444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041620020] [2025-03-16 19:29:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:01,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:01,105 INFO L87 Difference]: Start difference. First operand 18965 states and 25900 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:02,044 INFO L93 Difference]: Finished difference Result 45610 states and 63302 transitions. [2025-03-16 19:29:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:29:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:02,080 INFO L225 Difference]: With dead ends: 45610 [2025-03-16 19:29:02,080 INFO L226 Difference]: Without dead ends: 33376 [2025-03-16 19:29:02,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:29:02,094 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 3806 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:02,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3806 Valid, 3093 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33376 states. [2025-03-16 19:29:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33376 to 18423. [2025-03-16 19:29:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18423 states, 18422 states have (on average 1.3659211811963956) internal successors, (25163), 18422 states have internal predecessors, (25163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18423 states to 18423 states and 25163 transitions. [2025-03-16 19:29:02,456 INFO L78 Accepts]: Start accepts. Automaton has 18423 states and 25163 transitions. Word has length 86 [2025-03-16 19:29:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:02,456 INFO L471 AbstractCegarLoop]: Abstraction has 18423 states and 25163 transitions. [2025-03-16 19:29:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18423 states and 25163 transitions. [2025-03-16 19:29:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:29:02,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:02,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:29:02,467 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:02,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1043919265, now seen corresponding path program 1 times [2025-03-16 19:29:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569341506] [2025-03-16 19:29:02,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:29:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:29:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:02,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569341506] [2025-03-16 19:29:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569341506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:02,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:02,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008488292] [2025-03-16 19:29:02,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:02,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:02,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:02,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:02,722 INFO L87 Difference]: Start difference. First operand 18423 states and 25163 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:03,540 INFO L93 Difference]: Finished difference Result 39462 states and 54823 transitions. [2025-03-16 19:29:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:29:03,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:29:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:03,567 INFO L225 Difference]: With dead ends: 39462 [2025-03-16 19:29:03,567 INFO L226 Difference]: Without dead ends: 28110 [2025-03-16 19:29:03,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:03,581 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 3329 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:03,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3329 Valid, 3133 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28110 states. [2025-03-16 19:29:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28110 to 18337. [2025-03-16 19:29:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18337 states, 18336 states have (on average 1.3655650087260034) internal successors, (25039), 18336 states have internal predecessors, (25039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18337 states to 18337 states and 25039 transitions. [2025-03-16 19:29:03,790 INFO L78 Accepts]: Start accepts. Automaton has 18337 states and 25039 transitions. Word has length 86 [2025-03-16 19:29:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:03,790 INFO L471 AbstractCegarLoop]: Abstraction has 18337 states and 25039 transitions. [2025-03-16 19:29:03,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 18337 states and 25039 transitions. [2025-03-16 19:29:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:03,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:03,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:03,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:29:03,799 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:03,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1480794351, now seen corresponding path program 1 times [2025-03-16 19:29:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:03,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880675078] [2025-03-16 19:29:03,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:03,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:03,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:03,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:03,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880675078] [2025-03-16 19:29:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880675078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:03,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760158669] [2025-03-16 19:29:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:03,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:03,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:03,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:03,841 INFO L87 Difference]: Start difference. First operand 18337 states and 25039 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:03,911 INFO L93 Difference]: Finished difference Result 26578 states and 36585 transitions. [2025-03-16 19:29:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:03,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:29:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:03,927 INFO L225 Difference]: With dead ends: 26578 [2025-03-16 19:29:03,927 INFO L226 Difference]: Without dead ends: 18339 [2025-03-16 19:29:03,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:03,934 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 523 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:03,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2011 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18339 states. [2025-03-16 19:29:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18339 to 18337. [2025-03-16 19:29:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18337 states, 18336 states have (on average 1.3545484293193717) internal successors, (24837), 18336 states have internal predecessors, (24837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18337 states to 18337 states and 24837 transitions. [2025-03-16 19:29:04,091 INFO L78 Accepts]: Start accepts. Automaton has 18337 states and 24837 transitions. Word has length 87 [2025-03-16 19:29:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 18337 states and 24837 transitions. [2025-03-16 19:29:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18337 states and 24837 transitions. [2025-03-16 19:29:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:04,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:04,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:04,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:29:04,100 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash 379435051, now seen corresponding path program 1 times [2025-03-16 19:29:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045200659] [2025-03-16 19:29:04,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:04,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:04,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:04,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045200659] [2025-03-16 19:29:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045200659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:04,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703620142] [2025-03-16 19:29:04,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:04,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:04,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:04,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:04,518 INFO L87 Difference]: Start difference. First operand 18337 states and 24837 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:05,448 INFO L93 Difference]: Finished difference Result 31889 states and 43752 transitions. [2025-03-16 19:29:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:29:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:05,482 INFO L225 Difference]: With dead ends: 31889 [2025-03-16 19:29:05,482 INFO L226 Difference]: Without dead ends: 30158 [2025-03-16 19:29:05,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:05,494 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 5574 mSDsluCounter, 4283 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5574 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:05,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5574 Valid, 5104 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30158 states. [2025-03-16 19:29:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30158 to 18344. [2025-03-16 19:29:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18344 states, 18343 states have (on average 1.354576677751731) internal successors, (24847), 18343 states have internal predecessors, (24847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 24847 transitions. [2025-03-16 19:29:05,744 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 24847 transitions. Word has length 87 [2025-03-16 19:29:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:05,745 INFO L471 AbstractCegarLoop]: Abstraction has 18344 states and 24847 transitions. [2025-03-16 19:29:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 24847 transitions. [2025-03-16 19:29:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:29:05,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:05,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:05,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:29:05,754 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:05,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash -3974100, now seen corresponding path program 1 times [2025-03-16 19:29:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141315057] [2025-03-16 19:29:05,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:05,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:29:05,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:29:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:06,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141315057] [2025-03-16 19:29:06,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141315057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:06,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:29:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883649801] [2025-03-16 19:29:06,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:06,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:29:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:06,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:29:06,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:29:06,163 INFO L87 Difference]: Start difference. First operand 18344 states and 24847 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:06,894 INFO L93 Difference]: Finished difference Result 69064 states and 95801 transitions. [2025-03-16 19:29:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:29:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:29:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:07,016 INFO L225 Difference]: With dead ends: 69064 [2025-03-16 19:29:07,016 INFO L226 Difference]: Without dead ends: 57613 [2025-03-16 19:29:07,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:29:07,030 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 6218 mSDsluCounter, 6250 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6218 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:07,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6218 Valid, 7234 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57613 states. [2025-03-16 19:29:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57613 to 18073. [2025-03-16 19:29:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18073 states, 18072 states have (on average 1.3543050022133687) internal successors, (24475), 18072 states have internal predecessors, (24475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18073 states to 18073 states and 24475 transitions. [2025-03-16 19:29:07,350 INFO L78 Accepts]: Start accepts. Automaton has 18073 states and 24475 transitions. Word has length 87 [2025-03-16 19:29:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 18073 states and 24475 transitions. [2025-03-16 19:29:07,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18073 states and 24475 transitions. [2025-03-16 19:29:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:07,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:07,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:07,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:29:07,359 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1703322049, now seen corresponding path program 1 times [2025-03-16 19:29:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:07,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938298110] [2025-03-16 19:29:07,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:07,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:07,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:07,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:07,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938298110] [2025-03-16 19:29:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938298110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801717540] [2025-03-16 19:29:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:07,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:07,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:07,406 INFO L87 Difference]: Start difference. First operand 18073 states and 24475 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:07,516 INFO L93 Difference]: Finished difference Result 31360 states and 42804 transitions. [2025-03-16 19:29:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:07,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:29:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:07,535 INFO L225 Difference]: With dead ends: 31360 [2025-03-16 19:29:07,535 INFO L226 Difference]: Without dead ends: 21303 [2025-03-16 19:29:07,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:07,546 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 716 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:07,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 970 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21303 states. [2025-03-16 19:29:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21303 to 16613. [2025-03-16 19:29:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16613 states, 16612 states have (on average 1.3551649410065014) internal successors, (22512), 16612 states have internal predecessors, (22512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16613 states to 16613 states and 22512 transitions. [2025-03-16 19:29:07,707 INFO L78 Accepts]: Start accepts. Automaton has 16613 states and 22512 transitions. Word has length 88 [2025-03-16 19:29:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:07,707 INFO L471 AbstractCegarLoop]: Abstraction has 16613 states and 22512 transitions. [2025-03-16 19:29:07,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16613 states and 22512 transitions. [2025-03-16 19:29:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:07,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:07,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:07,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:29:07,715 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1531667858, now seen corresponding path program 1 times [2025-03-16 19:29:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225200411] [2025-03-16 19:29:07,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:07,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:07,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:07,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:07,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225200411] [2025-03-16 19:29:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225200411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492063647] [2025-03-16 19:29:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:07,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:07,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:07,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:07,884 INFO L87 Difference]: Start difference. First operand 16613 states and 22512 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:08,547 INFO L93 Difference]: Finished difference Result 36723 states and 50643 transitions. [2025-03-16 19:29:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:08,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:29:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:08,572 INFO L225 Difference]: With dead ends: 36723 [2025-03-16 19:29:08,572 INFO L226 Difference]: Without dead ends: 25477 [2025-03-16 19:29:08,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:08,583 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2512 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2512 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:08,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2512 Valid, 2204 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25477 states. [2025-03-16 19:29:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25477 to 16711. [2025-03-16 19:29:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16711 states, 16710 states have (on average 1.3541591861160982) internal successors, (22628), 16710 states have internal predecessors, (22628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16711 states to 16711 states and 22628 transitions. [2025-03-16 19:29:08,768 INFO L78 Accepts]: Start accepts. Automaton has 16711 states and 22628 transitions. Word has length 88 [2025-03-16 19:29:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:08,768 INFO L471 AbstractCegarLoop]: Abstraction has 16711 states and 22628 transitions. [2025-03-16 19:29:08,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 16711 states and 22628 transitions. [2025-03-16 19:29:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:08,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:29:08,775 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2015388269, now seen corresponding path program 1 times [2025-03-16 19:29:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40968303] [2025-03-16 19:29:08,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:08,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:08,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:08,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40968303] [2025-03-16 19:29:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40968303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197573047] [2025-03-16 19:29:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:08,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:08,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:08,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:08,955 INFO L87 Difference]: Start difference. First operand 16711 states and 22628 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,573 INFO L93 Difference]: Finished difference Result 25411 states and 34672 transitions. [2025-03-16 19:29:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:09,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:29:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,592 INFO L225 Difference]: With dead ends: 25411 [2025-03-16 19:29:09,592 INFO L226 Difference]: Without dead ends: 21605 [2025-03-16 19:29:09,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:09,600 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 2884 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 2019 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21605 states. [2025-03-16 19:29:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21605 to 16699. [2025-03-16 19:29:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16699 states, 16698 states have (on average 1.3536950532997964) internal successors, (22604), 16698 states have internal predecessors, (22604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16699 states to 16699 states and 22604 transitions. [2025-03-16 19:29:09,759 INFO L78 Accepts]: Start accepts. Automaton has 16699 states and 22604 transitions. Word has length 88 [2025-03-16 19:29:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 16699 states and 22604 transitions. [2025-03-16 19:29:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16699 states and 22604 transitions. [2025-03-16 19:29:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:29:09,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:09,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:09,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:29:09,767 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:09,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2018283948, now seen corresponding path program 1 times [2025-03-16 19:29:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708057842] [2025-03-16 19:29:09,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:09,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:29:09,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:29:09,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:09,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708057842] [2025-03-16 19:29:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708057842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269234845] [2025-03-16 19:29:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,812 INFO L87 Difference]: Start difference. First operand 16699 states and 22604 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:09,868 INFO L93 Difference]: Finished difference Result 25387 states and 34599 transitions. [2025-03-16 19:29:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:29:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:09,882 INFO L225 Difference]: With dead ends: 25387 [2025-03-16 19:29:09,882 INFO L226 Difference]: Without dead ends: 16701 [2025-03-16 19:29:09,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:09,889 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 493 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:09,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1798 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2025-03-16 19:29:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 16699. [2025-03-16 19:29:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16699 states, 16698 states have (on average 1.3447119415498863) internal successors, (22454), 16698 states have internal predecessors, (22454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16699 states to 16699 states and 22454 transitions. [2025-03-16 19:29:10,025 INFO L78 Accepts]: Start accepts. Automaton has 16699 states and 22454 transitions. Word has length 88 [2025-03-16 19:29:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 16699 states and 22454 transitions. [2025-03-16 19:29:10,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16699 states and 22454 transitions. [2025-03-16 19:29:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:10,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:10,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:29:10,033 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:10,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1906027537, now seen corresponding path program 1 times [2025-03-16 19:29:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124505357] [2025-03-16 19:29:10,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:10,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:10,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:10,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:10,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124505357] [2025-03-16 19:29:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124505357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:29:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911158607] [2025-03-16 19:29:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:10,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:29:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:29:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:10,363 INFO L87 Difference]: Start difference. First operand 16699 states and 22454 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:11,275 INFO L93 Difference]: Finished difference Result 47465 states and 65252 transitions. [2025-03-16 19:29:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:29:11,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:11,321 INFO L225 Difference]: With dead ends: 47465 [2025-03-16 19:29:11,321 INFO L226 Difference]: Without dead ends: 43677 [2025-03-16 19:29:11,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:29:11,338 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 5258 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5258 SdHoareTripleChecker+Valid, 4692 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:11,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5258 Valid, 4692 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43677 states. [2025-03-16 19:29:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43677 to 16693. [2025-03-16 19:29:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16693 states, 16692 states have (on average 1.344476395878265) internal successors, (22442), 16692 states have internal predecessors, (22442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16693 states to 16693 states and 22442 transitions. [2025-03-16 19:29:11,667 INFO L78 Accepts]: Start accepts. Automaton has 16693 states and 22442 transitions. Word has length 89 [2025-03-16 19:29:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:11,667 INFO L471 AbstractCegarLoop]: Abstraction has 16693 states and 22442 transitions. [2025-03-16 19:29:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16693 states and 22442 transitions. [2025-03-16 19:29:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:11,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:11,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:11,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:29:11,675 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:11,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1182902300, now seen corresponding path program 1 times [2025-03-16 19:29:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284246355] [2025-03-16 19:29:11,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:11,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:11,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:11,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284246355] [2025-03-16 19:29:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284246355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351715539] [2025-03-16 19:29:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:11,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:11,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:11,723 INFO L87 Difference]: Start difference. First operand 16693 states and 22442 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:11,800 INFO L93 Difference]: Finished difference Result 24379 states and 33042 transitions. [2025-03-16 19:29:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:11,815 INFO L225 Difference]: With dead ends: 24379 [2025-03-16 19:29:11,815 INFO L226 Difference]: Without dead ends: 16695 [2025-03-16 19:29:11,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:11,823 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 403 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:11,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1599 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16695 states. [2025-03-16 19:29:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16695 to 16693. [2025-03-16 19:29:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16693 states, 16692 states have (on average 1.3311766115504433) internal successors, (22220), 16692 states have internal predecessors, (22220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16693 states to 16693 states and 22220 transitions. [2025-03-16 19:29:11,964 INFO L78 Accepts]: Start accepts. Automaton has 16693 states and 22220 transitions. Word has length 89 [2025-03-16 19:29:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:11,964 INFO L471 AbstractCegarLoop]: Abstraction has 16693 states and 22220 transitions. [2025-03-16 19:29:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16693 states and 22220 transitions. [2025-03-16 19:29:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:11,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:11,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:11,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:29:11,972 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -633020132, now seen corresponding path program 1 times [2025-03-16 19:29:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361048559] [2025-03-16 19:29:11,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:11,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:11,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:11,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:11,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361048559] [2025-03-16 19:29:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361048559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221722744] [2025-03-16 19:29:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:12,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:12,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:12,018 INFO L87 Difference]: Start difference. First operand 16693 states and 22220 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:12,153 INFO L93 Difference]: Finished difference Result 29518 states and 39697 transitions. [2025-03-16 19:29:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:12,173 INFO L225 Difference]: With dead ends: 29518 [2025-03-16 19:29:12,173 INFO L226 Difference]: Without dead ends: 19649 [2025-03-16 19:29:12,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:12,187 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 638 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:12,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 815 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19649 states. [2025-03-16 19:29:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19649 to 15605. [2025-03-16 19:29:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15605 states, 15604 states have (on average 1.3359395026916174) internal successors, (20846), 15604 states have internal predecessors, (20846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 20846 transitions. [2025-03-16 19:29:12,343 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 20846 transitions. Word has length 89 [2025-03-16 19:29:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:12,343 INFO L471 AbstractCegarLoop]: Abstraction has 15605 states and 20846 transitions. [2025-03-16 19:29:12,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 20846 transitions. [2025-03-16 19:29:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:12,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:12,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:29:12,350 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 502782325, now seen corresponding path program 1 times [2025-03-16 19:29:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698997153] [2025-03-16 19:29:12,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:12,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:12,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698997153] [2025-03-16 19:29:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698997153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:12,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554401956] [2025-03-16 19:29:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:12,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:12,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:12,391 INFO L87 Difference]: Start difference. First operand 15605 states and 20846 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:12,459 INFO L93 Difference]: Finished difference Result 29313 states and 39363 transitions. [2025-03-16 19:29:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:29:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:12,476 INFO L225 Difference]: With dead ends: 29313 [2025-03-16 19:29:12,477 INFO L226 Difference]: Without dead ends: 19581 [2025-03-16 19:29:12,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:12,486 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 650 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:12,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1073 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19581 states. [2025-03-16 19:29:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19581 to 14660. [2025-03-16 19:29:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14660 states, 14659 states have (on average 1.3386315574050072) internal successors, (19623), 14659 states have internal predecessors, (19623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14660 states to 14660 states and 19623 transitions. [2025-03-16 19:29:12,623 INFO L78 Accepts]: Start accepts. Automaton has 14660 states and 19623 transitions. Word has length 89 [2025-03-16 19:29:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:12,623 INFO L471 AbstractCegarLoop]: Abstraction has 14660 states and 19623 transitions. [2025-03-16 19:29:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14660 states and 19623 transitions. [2025-03-16 19:29:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:29:12,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:12,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:12,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:29:12,630 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1298060908, now seen corresponding path program 1 times [2025-03-16 19:29:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064793097] [2025-03-16 19:29:12,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:12,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:29:12,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:29:12,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:12,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:12,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064793097] [2025-03-16 19:29:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064793097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:12,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:12,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989250154] [2025-03-16 19:29:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:12,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:12,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:12,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:12,787 INFO L87 Difference]: Start difference. First operand 14660 states and 19623 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:13,365 INFO L93 Difference]: Finished difference Result 23795 states and 32148 transitions. [2025-03-16 19:29:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:29:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:29:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:13,390 INFO L225 Difference]: With dead ends: 23795 [2025-03-16 19:29:13,390 INFO L226 Difference]: Without dead ends: 22521 [2025-03-16 19:29:13,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:29:13,399 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 2242 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:13,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2242 Valid, 2070 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22521 states. [2025-03-16 19:29:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22521 to 14651. [2025-03-16 19:29:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 14650 states have (on average 1.3384982935153584) internal successors, (19609), 14650 states have internal predecessors, (19609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 19609 transitions. [2025-03-16 19:29:13,587 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 19609 transitions. Word has length 90 [2025-03-16 19:29:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:13,587 INFO L471 AbstractCegarLoop]: Abstraction has 14651 states and 19609 transitions. [2025-03-16 19:29:13,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 19609 transitions. [2025-03-16 19:29:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:29:13,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:13,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:13,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 19:29:13,594 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:13,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1652300519, now seen corresponding path program 1 times [2025-03-16 19:29:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492507858] [2025-03-16 19:29:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:29:13,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:29:13,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492507858] [2025-03-16 19:29:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492507858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:13,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:13,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957555048] [2025-03-16 19:29:13,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:13,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:13,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:13,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:13,735 INFO L87 Difference]: Start difference. First operand 14651 states and 19609 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:14,260 INFO L93 Difference]: Finished difference Result 21018 states and 28154 transitions. [2025-03-16 19:29:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:29:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:14,280 INFO L225 Difference]: With dead ends: 21018 [2025-03-16 19:29:14,280 INFO L226 Difference]: Without dead ends: 19661 [2025-03-16 19:29:14,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:14,287 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1762 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:14,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2013 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19661 states. [2025-03-16 19:29:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19661 to 14592. [2025-03-16 19:29:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14592 states, 14591 states have (on average 1.3387019395517785) internal successors, (19533), 14591 states have internal predecessors, (19533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14592 states to 14592 states and 19533 transitions. [2025-03-16 19:29:14,436 INFO L78 Accepts]: Start accepts. Automaton has 14592 states and 19533 transitions. Word has length 90 [2025-03-16 19:29:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 14592 states and 19533 transitions. [2025-03-16 19:29:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 14592 states and 19533 transitions. [2025-03-16 19:29:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:29:14,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:14,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:14,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 19:29:14,443 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1270330052, now seen corresponding path program 1 times [2025-03-16 19:29:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516905559] [2025-03-16 19:29:14,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:14,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:29:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:29:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516905559] [2025-03-16 19:29:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516905559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492312470] [2025-03-16 19:29:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:14,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:14,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:14,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:14,789 INFO L87 Difference]: Start difference. First operand 14592 states and 19533 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:15,333 INFO L93 Difference]: Finished difference Result 22690 states and 30692 transitions. [2025-03-16 19:29:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:29:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:15,352 INFO L225 Difference]: With dead ends: 22690 [2025-03-16 19:29:15,352 INFO L226 Difference]: Without dead ends: 21768 [2025-03-16 19:29:15,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:15,358 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 3912 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3912 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:15,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3912 Valid, 3872 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21768 states. [2025-03-16 19:29:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21768 to 14494. [2025-03-16 19:29:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.3391982336300283) internal successors, (19409), 14493 states have internal predecessors, (19409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 19409 transitions. [2025-03-16 19:29:15,571 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 19409 transitions. Word has length 91 [2025-03-16 19:29:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:15,571 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 19409 transitions. [2025-03-16 19:29:15,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 19409 transitions. [2025-03-16 19:29:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:29:15,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:15,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:15,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 19:29:15,577 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1477152270, now seen corresponding path program 1 times [2025-03-16 19:29:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798282105] [2025-03-16 19:29:15,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:29:15,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:29:15,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:15,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798282105] [2025-03-16 19:29:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798282105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:29:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906404537] [2025-03-16 19:29:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:15,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:29:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:15,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:29:15,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:15,874 INFO L87 Difference]: Start difference. First operand 14494 states and 19409 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:16,388 INFO L93 Difference]: Finished difference Result 22601 states and 30578 transitions. [2025-03-16 19:29:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:29:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:16,409 INFO L225 Difference]: With dead ends: 22601 [2025-03-16 19:29:16,409 INFO L226 Difference]: Without dead ends: 21712 [2025-03-16 19:29:16,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:29:16,417 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 2681 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 4343 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:16,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 4343 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21712 states. [2025-03-16 19:29:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21712 to 14441. [2025-03-16 19:29:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14441 states, 14440 states have (on average 1.3396814404432134) internal successors, (19345), 14440 states have internal predecessors, (19345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14441 states to 14441 states and 19345 transitions. [2025-03-16 19:29:16,570 INFO L78 Accepts]: Start accepts. Automaton has 14441 states and 19345 transitions. Word has length 91 [2025-03-16 19:29:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 14441 states and 19345 transitions. [2025-03-16 19:29:16,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14441 states and 19345 transitions. [2025-03-16 19:29:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:29:16,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:16,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:16,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 19:29:16,577 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:16,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash -274566184, now seen corresponding path program 1 times [2025-03-16 19:29:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:16,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124310986] [2025-03-16 19:29:16,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:16,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:29:16,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:29:16,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:16,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:16,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124310986] [2025-03-16 19:29:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124310986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604493142] [2025-03-16 19:29:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:16,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:16,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:16,902 INFO L87 Difference]: Start difference. First operand 14441 states and 19345 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:17,421 INFO L93 Difference]: Finished difference Result 22024 states and 29780 transitions. [2025-03-16 19:29:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:29:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:17,440 INFO L225 Difference]: With dead ends: 22024 [2025-03-16 19:29:17,440 INFO L226 Difference]: Without dead ends: 21699 [2025-03-16 19:29:17,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:17,446 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 3283 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 3279 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:17,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3283 Valid, 3279 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21699 states. [2025-03-16 19:29:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21699 to 14428. [2025-03-16 19:29:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14428 states, 14427 states have (on average 1.3397795799542525) internal successors, (19329), 14427 states have internal predecessors, (19329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14428 states to 14428 states and 19329 transitions. [2025-03-16 19:29:17,583 INFO L78 Accepts]: Start accepts. Automaton has 14428 states and 19329 transitions. Word has length 91 [2025-03-16 19:29:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:17,583 INFO L471 AbstractCegarLoop]: Abstraction has 14428 states and 19329 transitions. [2025-03-16 19:29:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14428 states and 19329 transitions. [2025-03-16 19:29:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:29:17,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:17,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:17,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 19:29:17,591 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -490536221, now seen corresponding path program 1 times [2025-03-16 19:29:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236698289] [2025-03-16 19:29:17,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:17,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:29:17,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:29:17,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:17,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236698289] [2025-03-16 19:29:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236698289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121542177] [2025-03-16 19:29:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:17,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:17,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:17,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:17,783 INFO L87 Difference]: Start difference. First operand 14428 states and 19329 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:18,372 INFO L93 Difference]: Finished difference Result 19362 states and 25970 transitions. [2025-03-16 19:29:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:29:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:18,396 INFO L225 Difference]: With dead ends: 19362 [2025-03-16 19:29:18,396 INFO L226 Difference]: Without dead ends: 18926 [2025-03-16 19:29:18,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:18,404 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2568 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:18,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 1880 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18926 states. [2025-03-16 19:29:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18926 to 14428. [2025-03-16 19:29:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14428 states, 14427 states have (on average 1.3397102654744577) internal successors, (19328), 14427 states have internal predecessors, (19328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14428 states to 14428 states and 19328 transitions. [2025-03-16 19:29:18,633 INFO L78 Accepts]: Start accepts. Automaton has 14428 states and 19328 transitions. Word has length 94 [2025-03-16 19:29:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:18,633 INFO L471 AbstractCegarLoop]: Abstraction has 14428 states and 19328 transitions. [2025-03-16 19:29:18,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 14428 states and 19328 transitions. [2025-03-16 19:29:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:29:18,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:18,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:18,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 19:29:18,644 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:18,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1141505065, now seen corresponding path program 1 times [2025-03-16 19:29:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429928423] [2025-03-16 19:29:18,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:29:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:29:18,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:18,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429928423] [2025-03-16 19:29:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429928423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:18,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695373386] [2025-03-16 19:29:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:18,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:18,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:18,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:18,708 INFO L87 Difference]: Start difference. First operand 14428 states and 19328 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:18,769 INFO L93 Difference]: Finished difference Result 22130 states and 29850 transitions. [2025-03-16 19:29:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 19:29:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:18,783 INFO L225 Difference]: With dead ends: 22130 [2025-03-16 19:29:18,783 INFO L226 Difference]: Without dead ends: 14430 [2025-03-16 19:29:18,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:18,790 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 433 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1517 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-03-16 19:29:18,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1517 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14430 states. [2025-03-16 19:29:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14430 to 14428. [2025-03-16 19:29:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14428 states, 14427 states have (on average 1.3304221251819506) internal successors, (19194), 14427 states have internal predecessors, (19194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14428 states to 14428 states and 19194 transitions. [2025-03-16 19:29:18,926 INFO L78 Accepts]: Start accepts. Automaton has 14428 states and 19194 transitions. Word has length 95 [2025-03-16 19:29:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:18,927 INFO L471 AbstractCegarLoop]: Abstraction has 14428 states and 19194 transitions. [2025-03-16 19:29:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14428 states and 19194 transitions. [2025-03-16 19:29:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:29:18,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:18,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 19:29:18,935 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 835507152, now seen corresponding path program 1 times [2025-03-16 19:29:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:18,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599664550] [2025-03-16 19:29:18,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:18,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:29:18,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:29:18,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:18,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:19,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:19,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599664550] [2025-03-16 19:29:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599664550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:19,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427791473] [2025-03-16 19:29:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:19,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:19,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:19,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:19,089 INFO L87 Difference]: Start difference. First operand 14428 states and 19194 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:19,602 INFO L93 Difference]: Finished difference Result 19075 states and 25395 transitions. [2025-03-16 19:29:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 19:29:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:19,619 INFO L225 Difference]: With dead ends: 19075 [2025-03-16 19:29:19,619 INFO L226 Difference]: Without dead ends: 18926 [2025-03-16 19:29:19,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:19,623 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2568 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:19,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 1901 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18926 states. [2025-03-16 19:29:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18926 to 14428. [2025-03-16 19:29:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14428 states, 14427 states have (on average 1.3303528107021556) internal successors, (19193), 14427 states have internal predecessors, (19193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14428 states to 14428 states and 19193 transitions. [2025-03-16 19:29:19,752 INFO L78 Accepts]: Start accepts. Automaton has 14428 states and 19193 transitions. Word has length 95 [2025-03-16 19:29:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:19,752 INFO L471 AbstractCegarLoop]: Abstraction has 14428 states and 19193 transitions. [2025-03-16 19:29:19,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14428 states and 19193 transitions. [2025-03-16 19:29:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:19,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:19,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:19,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 19:29:19,760 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:19,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1986581060, now seen corresponding path program 1 times [2025-03-16 19:29:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630456674] [2025-03-16 19:29:19,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:19,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:19,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:19,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630456674] [2025-03-16 19:29:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630456674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43265033] [2025-03-16 19:29:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:19,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:19,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:19,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:19,799 INFO L87 Difference]: Start difference. First operand 14428 states and 19193 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:19,868 INFO L93 Difference]: Finished difference Result 26214 states and 35201 transitions. [2025-03-16 19:29:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:29:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:19,882 INFO L225 Difference]: With dead ends: 26214 [2025-03-16 19:29:19,882 INFO L226 Difference]: Without dead ends: 17348 [2025-03-16 19:29:19,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-03-16 19:29:19,890 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 629 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:19,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 916 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17348 states. [2025-03-16 19:29:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17348 to 13462. [2025-03-16 19:29:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13462 states, 13461 states have (on average 1.332739023846668) internal successors, (17940), 13461 states have internal predecessors, (17940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13462 states to 13462 states and 17940 transitions. [2025-03-16 19:29:20,006 INFO L78 Accepts]: Start accepts. Automaton has 13462 states and 17940 transitions. Word has length 96 [2025-03-16 19:29:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:20,006 INFO L471 AbstractCegarLoop]: Abstraction has 13462 states and 17940 transitions. [2025-03-16 19:29:20,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13462 states and 17940 transitions. [2025-03-16 19:29:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:20,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:20,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 19:29:20,013 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1489890537, now seen corresponding path program 1 times [2025-03-16 19:29:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834555041] [2025-03-16 19:29:20,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:20,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:20,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834555041] [2025-03-16 19:29:20,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834555041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:20,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:20,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:29:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528855978] [2025-03-16 19:29:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:29:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:20,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:29:20,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:20,328 INFO L87 Difference]: Start difference. First operand 13462 states and 17940 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:20,884 INFO L93 Difference]: Finished difference Result 20656 states and 27780 transitions. [2025-03-16 19:29:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:29:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:20,905 INFO L225 Difference]: With dead ends: 20656 [2025-03-16 19:29:20,905 INFO L226 Difference]: Without dead ends: 20446 [2025-03-16 19:29:20,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:20,913 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 3573 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:20,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3573 Valid, 3535 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20446 states. [2025-03-16 19:29:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20446 to 13400. [2025-03-16 19:29:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13400 states, 13399 states have (on average 1.333009926113889) internal successors, (17861), 13399 states have internal predecessors, (17861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13400 states to 13400 states and 17861 transitions. [2025-03-16 19:29:21,056 INFO L78 Accepts]: Start accepts. Automaton has 13400 states and 17861 transitions. Word has length 97 [2025-03-16 19:29:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:21,056 INFO L471 AbstractCegarLoop]: Abstraction has 13400 states and 17861 transitions. [2025-03-16 19:29:21,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 13400 states and 17861 transitions. [2025-03-16 19:29:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:29:21,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:21,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 19:29:21,068 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -240801884, now seen corresponding path program 1 times [2025-03-16 19:29:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574286508] [2025-03-16 19:29:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:21,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:29:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:29:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574286508] [2025-03-16 19:29:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574286508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144624768] [2025-03-16 19:29:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:21,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:21,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:21,158 INFO L87 Difference]: Start difference. First operand 13400 states and 17861 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:21,326 INFO L93 Difference]: Finished difference Result 48296 states and 66197 transitions. [2025-03-16 19:29:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:21,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:29:21,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:21,365 INFO L225 Difference]: With dead ends: 48296 [2025-03-16 19:29:21,365 INFO L226 Difference]: Without dead ends: 37980 [2025-03-16 19:29:21,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:29:21,381 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 3566 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3566 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:21,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3566 Valid, 1935 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37980 states. [2025-03-16 19:29:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37980 to 23714. [2025-03-16 19:29:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23714 states, 23713 states have (on average 1.341879981444777) internal successors, (31820), 23713 states have internal predecessors, (31820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23714 states to 23714 states and 31820 transitions. [2025-03-16 19:29:21,643 INFO L78 Accepts]: Start accepts. Automaton has 23714 states and 31820 transitions. Word has length 103 [2025-03-16 19:29:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:21,643 INFO L471 AbstractCegarLoop]: Abstraction has 23714 states and 31820 transitions. [2025-03-16 19:29:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 23714 states and 31820 transitions. [2025-03-16 19:29:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:29:21,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:21,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 19:29:21,659 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:21,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1154660774, now seen corresponding path program 1 times [2025-03-16 19:29:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133743438] [2025-03-16 19:29:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:21,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:29:21,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:29:21,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:21,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133743438] [2025-03-16 19:29:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133743438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127968972] [2025-03-16 19:29:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:21,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:21,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:21,764 INFO L87 Difference]: Start difference. First operand 23714 states and 31820 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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-03-16 19:29:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:21,953 INFO L93 Difference]: Finished difference Result 30500 states and 40856 transitions. [2025-03-16 19:29:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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 104 [2025-03-16 19:29:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:21,986 INFO L225 Difference]: With dead ends: 30500 [2025-03-16 19:29:21,986 INFO L226 Difference]: Without dead ends: 28524 [2025-03-16 19:29:21,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:21,997 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 1478 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:21,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 2087 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28524 states. [2025-03-16 19:29:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28524 to 27564. [2025-03-16 19:29:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27564 states, 27563 states have (on average 1.341907629793564) internal successors, (36987), 27563 states have internal predecessors, (36987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27564 states to 27564 states and 36987 transitions. [2025-03-16 19:29:22,243 INFO L78 Accepts]: Start accepts. Automaton has 27564 states and 36987 transitions. Word has length 104 [2025-03-16 19:29:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:22,243 INFO L471 AbstractCegarLoop]: Abstraction has 27564 states and 36987 transitions. [2025-03-16 19:29:22,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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-03-16 19:29:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 27564 states and 36987 transitions. [2025-03-16 19:29:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:29:22,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:22,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:22,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 19:29:22,259 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:22,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -934572093, now seen corresponding path program 1 times [2025-03-16 19:29:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078202656] [2025-03-16 19:29:22,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:29:22,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:29:22,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:22,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078202656] [2025-03-16 19:29:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078202656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:22,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405978108] [2025-03-16 19:29:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:22,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:22,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:22,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:22,332 INFO L87 Difference]: Start difference. First operand 27564 states and 36987 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-03-16 19:29:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:22,458 INFO L93 Difference]: Finished difference Result 73864 states and 100037 transitions. [2025-03-16 19:29:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-03-16 19:29:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:22,510 INFO L225 Difference]: With dead ends: 73864 [2025-03-16 19:29:22,510 INFO L226 Difference]: Without dead ends: 49370 [2025-03-16 19:29:22,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:22,536 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 219 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:22,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1247 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49370 states. [2025-03-16 19:29:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49370 to 46120. [2025-03-16 19:29:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46120 states, 46119 states have (on average 1.3458444458899803) internal successors, (62069), 46119 states have internal predecessors, (62069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46120 states to 46120 states and 62069 transitions. [2025-03-16 19:29:23,006 INFO L78 Accepts]: Start accepts. Automaton has 46120 states and 62069 transitions. Word has length 105 [2025-03-16 19:29:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:23,007 INFO L471 AbstractCegarLoop]: Abstraction has 46120 states and 62069 transitions. [2025-03-16 19:29:23,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-03-16 19:29:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46120 states and 62069 transitions. [2025-03-16 19:29:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:29:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:23,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:23,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 19:29:23,022 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:23,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2009946205, now seen corresponding path program 1 times [2025-03-16 19:29:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998163980] [2025-03-16 19:29:23,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:23,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:29:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:29:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998163980] [2025-03-16 19:29:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998163980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230275736] [2025-03-16 19:29:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:23,095 INFO L87 Difference]: Start difference. First operand 46120 states and 62069 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:23,328 INFO L93 Difference]: Finished difference Result 128460 states and 173639 transitions. [2025-03-16 19:29:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 19:29:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:23,421 INFO L225 Difference]: With dead ends: 128460 [2025-03-16 19:29:23,421 INFO L226 Difference]: Without dead ends: 85410 [2025-03-16 19:29:23,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:23,466 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 197 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:23,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1241 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85410 states. [2025-03-16 19:29:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85410 to 79312. [2025-03-16 19:29:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79312 states, 79311 states have (on average 1.3445928055376934) internal successors, (106641), 79311 states have internal predecessors, (106641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79312 states to 79312 states and 106641 transitions. [2025-03-16 19:29:24,196 INFO L78 Accepts]: Start accepts. Automaton has 79312 states and 106641 transitions. Word has length 106 [2025-03-16 19:29:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 79312 states and 106641 transitions. [2025-03-16 19:29:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 79312 states and 106641 transitions. [2025-03-16 19:29:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:29:24,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:24,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:24,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-16 19:29:24,209 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -177766012, now seen corresponding path program 1 times [2025-03-16 19:29:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054279327] [2025-03-16 19:29:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:24,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:29:24,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:29:24,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:24,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054279327] [2025-03-16 19:29:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054279327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847634662] [2025-03-16 19:29:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:24,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:24,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:24,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:24,277 INFO L87 Difference]: Start difference. First operand 79312 states and 106641 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:24,946 INFO L93 Difference]: Finished difference Result 224716 states and 302539 transitions. [2025-03-16 19:29:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-03-16 19:29:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:25,093 INFO L225 Difference]: With dead ends: 224716 [2025-03-16 19:29:25,093 INFO L226 Difference]: Without dead ends: 148474 [2025-03-16 19:29:25,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:25,143 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 171 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:25,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1233 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148474 states. [2025-03-16 19:29:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148474 to 137212. [2025-03-16 19:29:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137212 states, 137211 states have (on average 1.339637492620854) internal successors, (183813), 137211 states have internal predecessors, (183813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137212 states to 137212 states and 183813 transitions. [2025-03-16 19:29:26,738 INFO L78 Accepts]: Start accepts. Automaton has 137212 states and 183813 transitions. Word has length 107 [2025-03-16 19:29:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 137212 states and 183813 transitions. [2025-03-16 19:29:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 137212 states and 183813 transitions. [2025-03-16 19:29:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:29:26,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:26,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-16 19:29:26,750 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 963608953, now seen corresponding path program 1 times [2025-03-16 19:29:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092668011] [2025-03-16 19:29:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:26,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:29:26,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:29:26,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092668011] [2025-03-16 19:29:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092668011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445695630] [2025-03-16 19:29:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:26,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:26,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:26,827 INFO L87 Difference]: Start difference. First operand 137212 states and 183813 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:28,346 INFO L93 Difference]: Finished difference Result 394612 states and 528507 transitions. [2025-03-16 19:29:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:29:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:28,651 INFO L225 Difference]: With dead ends: 394612 [2025-03-16 19:29:28,651 INFO L226 Difference]: Without dead ends: 256607 [2025-03-16 19:29:28,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:28,712 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 128 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:28,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1224 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256607 states. [2025-03-16 19:29:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256607 to 240450. [2025-03-16 19:29:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240450 states, 240449 states have (on average 1.3317085951698697) internal successors, (320208), 240449 states have internal predecessors, (320208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240450 states to 240450 states and 320208 transitions. [2025-03-16 19:29:32,004 INFO L78 Accepts]: Start accepts. Automaton has 240450 states and 320208 transitions. Word has length 110 [2025-03-16 19:29:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 240450 states and 320208 transitions. [2025-03-16 19:29:32,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 240450 states and 320208 transitions. [2025-03-16 19:29:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:29:32,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:32,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:32,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-16 19:29:32,014 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:29:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1932599094, now seen corresponding path program 1 times [2025-03-16 19:29:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624366666] [2025-03-16 19:29:32,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:32,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:29:32,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:29:32,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:32,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624366666] [2025-03-16 19:29:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624366666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:32,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197964525] [2025-03-16 19:29:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:32,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:29:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:32,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:29:32,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:29:32,179 INFO L87 Difference]: Start difference. First operand 240450 states and 320208 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:33,008 INFO L93 Difference]: Finished difference Result 255431 states and 340180 transitions. [2025-03-16 19:29:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:29:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:29:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted.