./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afa96f494675daaffb7cf8ecfbe30f06e1bb06b9219ecf3df6181ac4e4f076f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:42:13,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:42:13,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:42:13,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:42:13,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:42:13,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:42:13,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:42:13,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:42:13,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:42:13,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:42:13,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:42:13,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:42:13,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:42:13,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:42:13,184 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:42:13,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:42:13,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:42:13,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:13,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:13,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:13,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:13,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:42:13,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:42:13,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afa96f494675daaffb7cf8ecfbe30f06e1bb06b9219ecf3df6181ac4e4f076f6 [2025-01-09 04:42:13,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:42:13,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:42:13,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:42:13,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:42:13,522 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:42:13,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:14,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9157ffe6e/147b9102d2134a2e97fd7b9b9ad2ae70/FLAGe3f3aeb32 [2025-01-09 04:42:15,228 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:42:15,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:15,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9157ffe6e/147b9102d2134a2e97fd7b9b9ad2ae70/FLAGe3f3aeb32 [2025-01-09 04:42:15,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9157ffe6e/147b9102d2134a2e97fd7b9b9ad2ae70 [2025-01-09 04:42:15,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:42:15,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:42:15,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:15,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:42:15,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:42:15,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:15" (1/1) ... [2025-01-09 04:42:15,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572410f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:15, skipping insertion in model container [2025-01-09 04:42:15,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:15" (1/1) ... [2025-01-09 04:42:15,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:42:15,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12460,12473] [2025-01-09 04:42:15,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19746,19759] [2025-01-09 04:42:15,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22098,22111] [2025-01-09 04:42:15,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23218,23231] [2025-01-09 04:42:15,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26768,26781] [2025-01-09 04:42:15,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27891,27904] [2025-01-09 04:42:15,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30206,30219] [2025-01-09 04:42:16,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:16,104 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:42:16,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12460,12473] [2025-01-09 04:42:16,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19746,19759] [2025-01-09 04:42:16,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22098,22111] [2025-01-09 04:42:16,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23218,23231] [2025-01-09 04:42:16,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26768,26781] [2025-01-09 04:42:16,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27891,27904] [2025-01-09 04:42:16,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30206,30219] [2025-01-09 04:42:16,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:16,449 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:42:16,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16 WrapperNode [2025-01-09 04:42:16,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:16,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:16,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:42:16,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:42:16,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,670 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7679 [2025-01-09 04:42:16,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:16,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:42:16,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:42:16,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:42:16,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,775 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-01-09 04:42:16,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:42:16,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:42:16,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:42:16,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:42:16,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (1/1) ... [2025-01-09 04:42:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:16,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:16,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:42:16,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:42:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:42:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:42:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:42:17,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:42:17,438 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:42:17,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:42:21,052 INFO L? ?]: Removed 1280 outVars from TransFormulas that were not future-live. [2025-01-09 04:42:21,053 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:42:21,098 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:42:21,100 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:42:21,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:21 BoogieIcfgContainer [2025-01-09 04:42:21,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:42:21,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:42:21,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:42:21,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:42:21,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:15" (1/3) ... [2025-01-09 04:42:21,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b63b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:21, skipping insertion in model container [2025-01-09 04:42:21,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:16" (2/3) ... [2025-01-09 04:42:21,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b63b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:21, skipping insertion in model container [2025-01-09 04:42:21,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:21" (3/3) ... [2025-01-09 04:42:21,111 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:21,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:42:21,128 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 1106 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-01-09 04:42:21,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:42:21,253 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;@695c7204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:42:21,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 04:42:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:21,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:21,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:21,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:21,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1160265217, now seen corresponding path program 1 times [2025-01-09 04:42:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713305792] [2025-01-09 04:42:21,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:21,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:21,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713305792] [2025-01-09 04:42:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713305792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632397761] [2025-01-09 04:42:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:21,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:21,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:21,869 INFO L87 Difference]: Start difference. First operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:22,155 INFO L93 Difference]: Finished difference Result 1465 states and 2651 transitions. [2025-01-09 04:42:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:22,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:22,179 INFO L225 Difference]: With dead ends: 1465 [2025-01-09 04:42:22,179 INFO L226 Difference]: Without dead ends: 1288 [2025-01-09 04:42:22,185 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-01-09 04:42:22,188 INFO L435 NwaCegarLoop]: 2055 mSDtfsCounter, 969 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:22,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3330 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-01-09 04:42:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1280. [2025-01-09 04:42:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1273 states have (on average 1.3165750196386488) internal successors, (1676), 1279 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1676 transitions. [2025-01-09 04:42:22,296 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1676 transitions. Word has length 64 [2025-01-09 04:42:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:22,296 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1676 transitions. [2025-01-09 04:42:22,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1676 transitions. [2025-01-09 04:42:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:22,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:22,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:42:22,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1978887998, now seen corresponding path program 1 times [2025-01-09 04:42:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924306335] [2025-01-09 04:42:22,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:22,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:22,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:22,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924306335] [2025-01-09 04:42:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924306335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:22,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874091730] [2025-01-09 04:42:22,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:22,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:22,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:22,544 INFO L87 Difference]: Start difference. First operand 1280 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:22,705 INFO L93 Difference]: Finished difference Result 1930 states and 2622 transitions. [2025-01-09 04:42:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:22,722 INFO L225 Difference]: With dead ends: 1930 [2025-01-09 04:42:22,723 INFO L226 Difference]: Without dead ends: 1576 [2025-01-09 04:42:22,726 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-01-09 04:42:22,728 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 717 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:22,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2315 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-09 04:42:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1568. [2025-01-09 04:42:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1561 states have (on average 1.3401665598975017) internal successors, (2092), 1567 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2092 transitions. [2025-01-09 04:42:22,800 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2092 transitions. Word has length 64 [2025-01-09 04:42:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2092 transitions. [2025-01-09 04:42:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2092 transitions. [2025-01-09 04:42:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:22,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:22,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:22,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:42:22,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1566940908, now seen corresponding path program 1 times [2025-01-09 04:42:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035943286] [2025-01-09 04:42:22,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:22,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:22,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:22,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:22,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:23,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035943286] [2025-01-09 04:42:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035943286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:23,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:23,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015081165] [2025-01-09 04:42:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:23,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:23,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:23,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:23,168 INFO L87 Difference]: Start difference. First operand 1568 states and 2092 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:23,839 INFO L93 Difference]: Finished difference Result 3046 states and 4188 transitions. [2025-01-09 04:42:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:23,847 INFO L225 Difference]: With dead ends: 3046 [2025-01-09 04:42:23,847 INFO L226 Difference]: Without dead ends: 1787 [2025-01-09 04:42:23,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:23,852 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3665 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:23,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 835 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-01-09 04:42:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1779. [2025-01-09 04:42:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1772 states have (on average 1.3876975169300225) internal successors, (2459), 1778 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2459 transitions. [2025-01-09 04:42:23,921 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2459 transitions. Word has length 64 [2025-01-09 04:42:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:23,922 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2459 transitions. [2025-01-09 04:42:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2459 transitions. [2025-01-09 04:42:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:42:23,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:23,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:42:23,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1913482263, now seen corresponding path program 1 times [2025-01-09 04:42:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64894661] [2025-01-09 04:42:23,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:23,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:42:23,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:42:23,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:23,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64894661] [2025-01-09 04:42:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64894661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:24,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594122486] [2025-01-09 04:42:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:24,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:24,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:24,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:24,063 INFO L87 Difference]: Start difference. First operand 1779 states and 2459 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:24,125 INFO L93 Difference]: Finished difference Result 4129 states and 5823 transitions. [2025-01-09 04:42:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:42:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:24,138 INFO L225 Difference]: With dead ends: 4129 [2025-01-09 04:42:24,139 INFO L226 Difference]: Without dead ends: 2953 [2025-01-09 04:42:24,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-01-09 04:42:24,143 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 897 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:24,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2140 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2025-01-09 04:42:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2941. [2025-01-09 04:42:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2934 states have (on average 1.3895705521472392) internal successors, (4077), 2940 states have internal predecessors, (4077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4077 transitions. [2025-01-09 04:42:24,222 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4077 transitions. Word has length 65 [2025-01-09 04:42:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 4077 transitions. [2025-01-09 04:42:24,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4077 transitions. [2025-01-09 04:42:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:42:24,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:24,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:24,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:42:24,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:24,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1759204869, now seen corresponding path program 1 times [2025-01-09 04:42:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543860588] [2025-01-09 04:42:24,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:24,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:42:24,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:42:24,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543860588] [2025-01-09 04:42:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543860588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077951202] [2025-01-09 04:42:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:24,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:24,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:24,479 INFO L87 Difference]: Start difference. First operand 2941 states and 4077 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:25,126 INFO L93 Difference]: Finished difference Result 5812 states and 8153 transitions. [2025-01-09 04:42:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:42:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:25,140 INFO L225 Difference]: With dead ends: 5812 [2025-01-09 04:42:25,140 INFO L226 Difference]: Without dead ends: 3476 [2025-01-09 04:42:25,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:25,146 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 3065 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:25,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 696 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-01-09 04:42:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3460. [2025-01-09 04:42:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3453 states have (on average 1.3828554879814654) internal successors, (4775), 3459 states have internal predecessors, (4775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4775 transitions. [2025-01-09 04:42:25,228 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4775 transitions. Word has length 65 [2025-01-09 04:42:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 4775 transitions. [2025-01-09 04:42:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4775 transitions. [2025-01-09 04:42:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:42:25,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:25,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:42:25,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:25,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1773849621, now seen corresponding path program 1 times [2025-01-09 04:42:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077308386] [2025-01-09 04:42:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:25,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:42:25,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:42:25,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:25,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077308386] [2025-01-09 04:42:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077308386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518757640] [2025-01-09 04:42:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:25,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:25,400 INFO L87 Difference]: Start difference. First operand 3460 states and 4775 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:26,043 INFO L93 Difference]: Finished difference Result 8470 states and 11935 transitions. [2025-01-09 04:42:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:42:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:26,063 INFO L225 Difference]: With dead ends: 8470 [2025-01-09 04:42:26,064 INFO L226 Difference]: Without dead ends: 5300 [2025-01-09 04:42:26,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:26,070 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2730 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:26,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2730 Valid, 645 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2025-01-09 04:42:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 5292. [2025-01-09 04:42:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5285 states have (on average 1.4081362346263009) internal successors, (7442), 5291 states have internal predecessors, (7442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7442 transitions. [2025-01-09 04:42:26,182 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7442 transitions. Word has length 65 [2025-01-09 04:42:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:26,183 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 7442 transitions. [2025-01-09 04:42:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7442 transitions. [2025-01-09 04:42:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:42:26,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:26,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:42:26,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2076438910, now seen corresponding path program 1 times [2025-01-09 04:42:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:26,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827075107] [2025-01-09 04:42:26,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:26,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:26,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:42:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:42:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827075107] [2025-01-09 04:42:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827075107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061009137] [2025-01-09 04:42:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:26,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:26,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:26,289 INFO L87 Difference]: Start difference. First operand 5292 states and 7442 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:26,359 INFO L93 Difference]: Finished difference Result 11472 states and 16248 transitions. [2025-01-09 04:42:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:42:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:26,387 INFO L225 Difference]: With dead ends: 11472 [2025-01-09 04:42:26,388 INFO L226 Difference]: Without dead ends: 7315 [2025-01-09 04:42:26,396 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-01-09 04:42:26,396 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 585 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:26,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1532 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7315 states. [2025-01-09 04:42:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7315 to 7283. [2025-01-09 04:42:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7276 states have (on average 1.3845519516217701) internal successors, (10074), 7282 states have internal predecessors, (10074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 10074 transitions. [2025-01-09 04:42:26,586 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 10074 transitions. Word has length 66 [2025-01-09 04:42:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:26,586 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 10074 transitions. [2025-01-09 04:42:26,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 10074 transitions. [2025-01-09 04:42:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:42:26,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:26,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:26,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:42:26,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1790108590, now seen corresponding path program 1 times [2025-01-09 04:42:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222361363] [2025-01-09 04:42:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:26,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:42:26,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:42:26,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:26,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222361363] [2025-01-09 04:42:26,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222361363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:26,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87757243] [2025-01-09 04:42:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:26,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:26,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:26,754 INFO L87 Difference]: Start difference. First operand 7283 states and 10074 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:27,202 INFO L93 Difference]: Finished difference Result 16628 states and 23145 transitions. [2025-01-09 04:42:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:42:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:27,246 INFO L225 Difference]: With dead ends: 16628 [2025-01-09 04:42:27,246 INFO L226 Difference]: Without dead ends: 9782 [2025-01-09 04:42:27,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:27,259 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 2390 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:27,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 580 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2025-01-09 04:42:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 9738. [2025-01-09 04:42:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9738 states, 9731 states have (on average 1.3830027746377556) internal successors, (13458), 9737 states have internal predecessors, (13458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 13458 transitions. [2025-01-09 04:42:27,470 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 13458 transitions. Word has length 67 [2025-01-09 04:42:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:27,471 INFO L471 AbstractCegarLoop]: Abstraction has 9738 states and 13458 transitions. [2025-01-09 04:42:27,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 13458 transitions. [2025-01-09 04:42:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:42:27,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:27,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:27,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:42:27,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash 185593086, now seen corresponding path program 1 times [2025-01-09 04:42:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315775567] [2025-01-09 04:42:27,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:27,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:42:27,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:42:27,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:27,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:27,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-01-09 04:42:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:27,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315775567] [2025-01-09 04:42:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315775567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:27,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820673919] [2025-01-09 04:42:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:27,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:27,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:27,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:27,674 INFO L87 Difference]: Start difference. First operand 9738 states and 13458 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:28,489 INFO L93 Difference]: Finished difference Result 27452 states and 38510 transitions. [2025-01-09 04:42:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:28,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:42:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:28,542 INFO L225 Difference]: With dead ends: 27452 [2025-01-09 04:42:28,543 INFO L226 Difference]: Without dead ends: 23801 [2025-01-09 04:42:28,556 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-01-09 04:42:28,557 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3231 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3231 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:28,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3231 Valid, 1122 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23801 states. [2025-01-09 04:42:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23801 to 9806. [2025-01-09 04:42:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 9799 states have (on average 1.3823859577507909) internal successors, (13546), 9805 states have internal predecessors, (13546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 13546 transitions. [2025-01-09 04:42:28,830 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 13546 transitions. Word has length 68 [2025-01-09 04:42:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:28,830 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 13546 transitions. [2025-01-09 04:42:28,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 13546 transitions. [2025-01-09 04:42:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:42:28,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:28,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:42:28,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash 290423248, now seen corresponding path program 1 times [2025-01-09 04:42:28,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:28,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723018700] [2025-01-09 04:42:28,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:28,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:42:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:42:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:28,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723018700] [2025-01-09 04:42:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723018700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424587957] [2025-01-09 04:42:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:29,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:29,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:29,110 INFO L87 Difference]: Start difference. First operand 9806 states and 13546 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:29,910 INFO L93 Difference]: Finished difference Result 26125 states and 36562 transitions. [2025-01-09 04:42:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:42:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:29,965 INFO L225 Difference]: With dead ends: 26125 [2025-01-09 04:42:29,966 INFO L226 Difference]: Without dead ends: 21483 [2025-01-09 04:42:29,981 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-01-09 04:42:29,982 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 3135 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3135 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:29,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3135 Valid, 1104 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21483 states. [2025-01-09 04:42:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21483 to 9962. [2025-01-09 04:42:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9962 states, 9955 states have (on average 1.381416373681567) internal successors, (13752), 9961 states have internal predecessors, (13752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 13752 transitions. [2025-01-09 04:42:30,330 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 13752 transitions. Word has length 68 [2025-01-09 04:42:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:30,330 INFO L471 AbstractCegarLoop]: Abstraction has 9962 states and 13752 transitions. [2025-01-09 04:42:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 13752 transitions. [2025-01-09 04:42:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:42:30,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:30,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:30,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:42:30,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash -770234336, now seen corresponding path program 1 times [2025-01-09 04:42:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762095244] [2025-01-09 04:42:30,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:30,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:42:30,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:42:30,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:30,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762095244] [2025-01-09 04:42:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762095244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71208050] [2025-01-09 04:42:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:30,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:30,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:30,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:30,570 INFO L87 Difference]: Start difference. First operand 9962 states and 13752 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:31,265 INFO L93 Difference]: Finished difference Result 23557 states and 32840 transitions. [2025-01-09 04:42:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:42:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:31,295 INFO L225 Difference]: With dead ends: 23557 [2025-01-09 04:42:31,295 INFO L226 Difference]: Without dead ends: 19281 [2025-01-09 04:42:31,306 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-01-09 04:42:31,306 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 3058 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:31,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 1085 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2025-01-09 04:42:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 10033. [2025-01-09 04:42:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10033 states, 10026 states have (on average 1.381508078994614) internal successors, (13851), 10032 states have internal predecessors, (13851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10033 states to 10033 states and 13851 transitions. [2025-01-09 04:42:31,499 INFO L78 Accepts]: Start accepts. Automaton has 10033 states and 13851 transitions. Word has length 68 [2025-01-09 04:42:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:31,500 INFO L471 AbstractCegarLoop]: Abstraction has 10033 states and 13851 transitions. [2025-01-09 04:42:31,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 10033 states and 13851 transitions. [2025-01-09 04:42:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:42:31,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:31,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:42:31,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2053099389, now seen corresponding path program 1 times [2025-01-09 04:42:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10698298] [2025-01-09 04:42:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:31,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:42:31,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:42:31,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:31,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10698298] [2025-01-09 04:42:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10698298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386338188] [2025-01-09 04:42:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:31,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:31,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:31,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:31,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:31,699 INFO L87 Difference]: Start difference. First operand 10033 states and 13851 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:32,288 INFO L93 Difference]: Finished difference Result 21345 states and 29649 transitions. [2025-01-09 04:42:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:42:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:32,314 INFO L225 Difference]: With dead ends: 21345 [2025-01-09 04:42:32,314 INFO L226 Difference]: Without dead ends: 16603 [2025-01-09 04:42:32,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:42:32,326 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2887 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:32,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 1060 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:42:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16603 states. [2025-01-09 04:42:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16603 to 10068. [2025-01-09 04:42:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10061 states have (on average 1.3811748335155551) internal successors, (13896), 10067 states have internal predecessors, (13896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 13896 transitions. [2025-01-09 04:42:32,559 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 13896 transitions. Word has length 68 [2025-01-09 04:42:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:32,559 INFO L471 AbstractCegarLoop]: Abstraction has 10068 states and 13896 transitions. [2025-01-09 04:42:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 13896 transitions. [2025-01-09 04:42:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:42:32,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:32,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:32,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:42:32,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 43383936, now seen corresponding path program 1 times [2025-01-09 04:42:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089570562] [2025-01-09 04:42:32,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:32,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:42:32,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:42:32,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:32,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089570562] [2025-01-09 04:42:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089570562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:32,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:42:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225860553] [2025-01-09 04:42:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:32,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:42:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:32,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:42:32,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:42:32,961 INFO L87 Difference]: Start difference. First operand 10068 states and 13896 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:33,673 INFO L93 Difference]: Finished difference Result 25745 states and 36188 transitions. [2025-01-09 04:42:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:42:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:42:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:33,699 INFO L225 Difference]: With dead ends: 25745 [2025-01-09 04:42:33,700 INFO L226 Difference]: Without dead ends: 18612 [2025-01-09 04:42:33,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:42:33,713 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2933 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2933 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:33,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2933 Valid, 1487 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18612 states. [2025-01-09 04:42:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18612 to 9762. [2025-01-09 04:42:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9755 states have (on average 1.380112762685802) internal successors, (13463), 9761 states have internal predecessors, (13463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 13463 transitions. [2025-01-09 04:42:33,999 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 13463 transitions. Word has length 69 [2025-01-09 04:42:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:34,000 INFO L471 AbstractCegarLoop]: Abstraction has 9762 states and 13463 transitions. [2025-01-09 04:42:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 13463 transitions. [2025-01-09 04:42:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:42:34,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:34,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:34,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:42:34,026 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:34,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash 80806030, now seen corresponding path program 1 times [2025-01-09 04:42:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:34,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11741306] [2025-01-09 04:42:34,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:42:34,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:42:34,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11741306] [2025-01-09 04:42:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11741306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858511059] [2025-01-09 04:42:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:34,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:34,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:34,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:34,402 INFO L87 Difference]: Start difference. First operand 9762 states and 13463 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:35,466 INFO L93 Difference]: Finished difference Result 24911 states and 34970 transitions. [2025-01-09 04:42:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:42:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:35,487 INFO L225 Difference]: With dead ends: 24911 [2025-01-09 04:42:35,487 INFO L226 Difference]: Without dead ends: 18236 [2025-01-09 04:42:35,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:42:35,496 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 2418 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:35,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2418 Valid, 2295 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:42:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18236 states. [2025-01-09 04:42:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18236 to 9627. [2025-01-09 04:42:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9627 states, 9620 states have (on average 1.3798336798336799) internal successors, (13274), 9626 states have internal predecessors, (13274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 13274 transitions. [2025-01-09 04:42:35,683 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 13274 transitions. Word has length 69 [2025-01-09 04:42:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 9627 states and 13274 transitions. [2025-01-09 04:42:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 13274 transitions. [2025-01-09 04:42:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:42:35,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:35,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:42:35,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1560265185, now seen corresponding path program 1 times [2025-01-09 04:42:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559975339] [2025-01-09 04:42:35,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:42:35,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:42:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:35,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559975339] [2025-01-09 04:42:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559975339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534418717] [2025-01-09 04:42:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:36,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:36,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:36,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:36,106 INFO L87 Difference]: Start difference. First operand 9627 states and 13274 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:37,019 INFO L93 Difference]: Finished difference Result 21284 states and 29794 transitions. [2025-01-09 04:42:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:42:37,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:42:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:37,037 INFO L225 Difference]: With dead ends: 21284 [2025-01-09 04:42:37,038 INFO L226 Difference]: Without dead ends: 14833 [2025-01-09 04:42:37,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:37,049 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 3415 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3415 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:37,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3415 Valid, 1918 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:42:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14833 states. [2025-01-09 04:42:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14833 to 9603. [2025-01-09 04:42:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9603 states, 9596 states have (on average 1.3792205085452272) internal successors, (13235), 9602 states have internal predecessors, (13235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9603 states to 9603 states and 13235 transitions. [2025-01-09 04:42:37,248 INFO L78 Accepts]: Start accepts. Automaton has 9603 states and 13235 transitions. Word has length 69 [2025-01-09 04:42:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:37,248 INFO L471 AbstractCegarLoop]: Abstraction has 9603 states and 13235 transitions. [2025-01-09 04:42:37,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9603 states and 13235 transitions. [2025-01-09 04:42:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:42:37,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:37,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:37,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:42:37,256 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1474423363, now seen corresponding path program 1 times [2025-01-09 04:42:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696545922] [2025-01-09 04:42:37,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:37,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:37,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:42:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:42:37,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:37,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696545922] [2025-01-09 04:42:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696545922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:37,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15271067] [2025-01-09 04:42:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:37,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:37,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:37,628 INFO L87 Difference]: Start difference. First operand 9603 states and 13235 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:38,566 INFO L93 Difference]: Finished difference Result 21074 states and 29485 transitions. [2025-01-09 04:42:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:42:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:42:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:38,587 INFO L225 Difference]: With dead ends: 21074 [2025-01-09 04:42:38,588 INFO L226 Difference]: Without dead ends: 14650 [2025-01-09 04:42:38,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:38,600 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 3407 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3407 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:38,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3407 Valid, 1900 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:42:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14650 states. [2025-01-09 04:42:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14650 to 9591. [2025-01-09 04:42:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9591 states, 9584 states have (on average 1.3785475792988313) internal successors, (13212), 9590 states have internal predecessors, (13212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9591 states to 9591 states and 13212 transitions. [2025-01-09 04:42:38,793 INFO L78 Accepts]: Start accepts. Automaton has 9591 states and 13212 transitions. Word has length 69 [2025-01-09 04:42:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:38,793 INFO L471 AbstractCegarLoop]: Abstraction has 9591 states and 13212 transitions. [2025-01-09 04:42:38,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9591 states and 13212 transitions. [2025-01-09 04:42:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:42:38,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:38,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] [2025-01-09 04:42:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:42:38,799 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash -688548458, now seen corresponding path program 1 times [2025-01-09 04:42:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056638438] [2025-01-09 04:42:38,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:42:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:42:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056638438] [2025-01-09 04:42:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056638438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:42:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323580746] [2025-01-09 04:42:39,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:42:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:39,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:42:39,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:42:39,551 INFO L87 Difference]: Start difference. First operand 9591 states and 13212 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:41,194 INFO L93 Difference]: Finished difference Result 34120 states and 48024 transitions. [2025-01-09 04:42:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:42:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:42:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:41,226 INFO L225 Difference]: With dead ends: 34120 [2025-01-09 04:42:41,226 INFO L226 Difference]: Without dead ends: 27699 [2025-01-09 04:42:41,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:42:41,238 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 5276 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5276 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:41,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5276 Valid, 3833 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:42:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27699 states. [2025-01-09 04:42:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27699 to 9571. [2025-01-09 04:42:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9565 states have (on average 1.377417668583377) internal successors, (13175), 9570 states have internal predecessors, (13175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 13175 transitions. [2025-01-09 04:42:41,410 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 13175 transitions. Word has length 70 [2025-01-09 04:42:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:41,410 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 13175 transitions. [2025-01-09 04:42:41,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 13175 transitions. [2025-01-09 04:42:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:42:41,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:41,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:41,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:42:41,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:41,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1142484158, now seen corresponding path program 1 times [2025-01-09 04:42:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:41,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668800161] [2025-01-09 04:42:41,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:42:41,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:42:41,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668800161] [2025-01-09 04:42:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668800161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:41,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:41,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:42:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252746040] [2025-01-09 04:42:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:41,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:42:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:41,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:42:41,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:42:41,926 INFO L87 Difference]: Start difference. First operand 9571 states and 13175 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:42,871 INFO L93 Difference]: Finished difference Result 27781 states and 39000 transitions. [2025-01-09 04:42:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:42:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:42,895 INFO L225 Difference]: With dead ends: 27781 [2025-01-09 04:42:42,896 INFO L226 Difference]: Without dead ends: 21104 [2025-01-09 04:42:42,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:42:42,904 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 4609 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:42,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 2601 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21104 states. [2025-01-09 04:42:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21104 to 9322. [2025-01-09 04:42:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9322 states, 9317 states have (on average 1.3754427390791026) internal successors, (12815), 9321 states have internal predecessors, (12815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9322 states to 9322 states and 12815 transitions. [2025-01-09 04:42:43,037 INFO L78 Accepts]: Start accepts. Automaton has 9322 states and 12815 transitions. Word has length 70 [2025-01-09 04:42:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:43,037 INFO L471 AbstractCegarLoop]: Abstraction has 9322 states and 12815 transitions. [2025-01-09 04:42:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9322 states and 12815 transitions. [2025-01-09 04:42:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:42:43,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:43,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:43,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:42:43,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:43,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1346201798, now seen corresponding path program 1 times [2025-01-09 04:42:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641640540] [2025-01-09 04:42:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:43,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:42:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:42:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641640540] [2025-01-09 04:42:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641640540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761613758] [2025-01-09 04:42:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:43,118 INFO L87 Difference]: Start difference. First operand 9322 states and 12815 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:43,171 INFO L93 Difference]: Finished difference Result 13044 states and 18007 transitions. [2025-01-09 04:42:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:43,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:42:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:43,183 INFO L225 Difference]: With dead ends: 13044 [2025-01-09 04:42:43,184 INFO L226 Difference]: Without dead ends: 9328 [2025-01-09 04:42:43,190 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-01-09 04:42:43,191 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 428 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:43,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1357 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9328 states. [2025-01-09 04:42:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9328 to 9322. [2025-01-09 04:42:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9322 states, 9317 states have (on average 1.3622410647204035) internal successors, (12692), 9321 states have internal predecessors, (12692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9322 states to 9322 states and 12692 transitions. [2025-01-09 04:42:43,299 INFO L78 Accepts]: Start accepts. Automaton has 9322 states and 12692 transitions. Word has length 70 [2025-01-09 04:42:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 9322 states and 12692 transitions. [2025-01-09 04:42:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9322 states and 12692 transitions. [2025-01-09 04:42:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:42:43,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:43,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:43,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:42:43,305 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:43,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1360936426, now seen corresponding path program 1 times [2025-01-09 04:42:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473214215] [2025-01-09 04:42:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:42:43,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:42:43,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:43,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473214215] [2025-01-09 04:42:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473214215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:42:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674456721] [2025-01-09 04:42:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:42:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:43,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:42:43,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:42:43,752 INFO L87 Difference]: Start difference. First operand 9322 states and 12692 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:44,519 INFO L93 Difference]: Finished difference Result 18156 states and 25129 transitions. [2025-01-09 04:42:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:42:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:44,535 INFO L225 Difference]: With dead ends: 18156 [2025-01-09 04:42:44,535 INFO L226 Difference]: Without dead ends: 11364 [2025-01-09 04:42:44,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:42:44,545 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 3334 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3334 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:44,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3334 Valid, 2703 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11364 states. [2025-01-09 04:42:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11364 to 8925. [2025-01-09 04:42:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8925 states, 8922 states have (on average 1.3635956063662855) internal successors, (12166), 8924 states have internal predecessors, (12166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8925 states to 8925 states and 12166 transitions. [2025-01-09 04:42:44,716 INFO L78 Accepts]: Start accepts. Automaton has 8925 states and 12166 transitions. Word has length 70 [2025-01-09 04:42:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:44,717 INFO L471 AbstractCegarLoop]: Abstraction has 8925 states and 12166 transitions. [2025-01-09 04:42:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 8925 states and 12166 transitions. [2025-01-09 04:42:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:42:44,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:44,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:44,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:42:44,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash -452169058, now seen corresponding path program 1 times [2025-01-09 04:42:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949427891] [2025-01-09 04:42:44,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:44,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:44,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:42:44,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:42:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949427891] [2025-01-09 04:42:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949427891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536434961] [2025-01-09 04:42:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:44,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:44,803 INFO L87 Difference]: Start difference. First operand 8925 states and 12166 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:44,924 INFO L93 Difference]: Finished difference Result 18405 states and 25335 transitions. [2025-01-09 04:42:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:42:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:44,942 INFO L225 Difference]: With dead ends: 18405 [2025-01-09 04:42:44,943 INFO L226 Difference]: Without dead ends: 12892 [2025-01-09 04:42:44,951 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-01-09 04:42:44,954 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 381 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:44,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 528 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12892 states. [2025-01-09 04:42:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12892 to 12854. [2025-01-09 04:42:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12854 states, 12853 states have (on average 1.38131175601027) internal successors, (17754), 12853 states have internal predecessors, (17754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 17754 transitions. [2025-01-09 04:42:45,121 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 17754 transitions. Word has length 72 [2025-01-09 04:42:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:45,121 INFO L471 AbstractCegarLoop]: Abstraction has 12854 states and 17754 transitions. [2025-01-09 04:42:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 17754 transitions. [2025-01-09 04:42:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:42:45,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:45,133 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-01-09 04:42:45,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:42:45,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash -786160929, now seen corresponding path program 1 times [2025-01-09 04:42:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665277381] [2025-01-09 04:42:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:45,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:42:45,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:42:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665277381] [2025-01-09 04:42:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665277381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:45,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820931157] [2025-01-09 04:42:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:45,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:42:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:45,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:42:45,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:45,259 INFO L87 Difference]: Start difference. First operand 12854 states and 17754 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) 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-01-09 04:42:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:45,502 INFO L93 Difference]: Finished difference Result 60276 states and 85196 transitions. [2025-01-09 04:42:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) 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-01-09 04:42:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:45,579 INFO L225 Difference]: With dead ends: 60276 [2025-01-09 04:42:45,580 INFO L226 Difference]: Without dead ends: 49753 [2025-01-09 04:42:45,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:45,610 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 2053 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:45,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2053 Valid, 1224 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49753 states. [2025-01-09 04:42:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49753 to 23375. [2025-01-09 04:42:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23375 states, 23374 states have (on average 1.38423034140498) internal successors, (32355), 23374 states have internal predecessors, (32355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23375 states to 23375 states and 32355 transitions. [2025-01-09 04:42:46,098 INFO L78 Accepts]: Start accepts. Automaton has 23375 states and 32355 transitions. Word has length 86 [2025-01-09 04:42:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 23375 states and 32355 transitions. [2025-01-09 04:42:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) 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-01-09 04:42:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23375 states and 32355 transitions. [2025-01-09 04:42:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:42:46,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:46,113 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-01-09 04:42:46,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:42:46,113 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 623918678, now seen corresponding path program 1 times [2025-01-09 04:42:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132792631] [2025-01-09 04:42:46,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:46,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:42:46,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:42:46,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:46,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132792631] [2025-01-09 04:42:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132792631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288776928] [2025-01-09 04:42:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:46,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:42:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:42:46,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:46,247 INFO L87 Difference]: Start difference. First operand 23375 states and 32355 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-01-09 04:42:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:46,502 INFO L93 Difference]: Finished difference Result 38287 states and 52891 transitions. [2025-01-09 04:42:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-01-09 04:42:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:46,540 INFO L225 Difference]: With dead ends: 38287 [2025-01-09 04:42:46,540 INFO L226 Difference]: Without dead ends: 25474 [2025-01-09 04:42:46,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:46,557 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 905 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:46,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1400 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25474 states. [2025-01-09 04:42:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25474 to 18418. [2025-01-09 04:42:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18418 states, 18417 states have (on average 1.3623825813107455) internal successors, (25091), 18417 states have internal predecessors, (25091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18418 states to 18418 states and 25091 transitions. [2025-01-09 04:42:46,783 INFO L78 Accepts]: Start accepts. Automaton has 18418 states and 25091 transitions. Word has length 87 [2025-01-09 04:42:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:46,783 INFO L471 AbstractCegarLoop]: Abstraction has 18418 states and 25091 transitions. [2025-01-09 04:42:46,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-01-09 04:42:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18418 states and 25091 transitions. [2025-01-09 04:42:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:42:46,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:46,795 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-01-09 04:42:46,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:42:46,795 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash 803271302, now seen corresponding path program 1 times [2025-01-09 04:42:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:46,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748908904] [2025-01-09 04:42:46,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:46,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:42:46,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:42:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:46,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748908904] [2025-01-09 04:42:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748908904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:46,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489996488] [2025-01-09 04:42:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:46,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:46,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:46,949 INFO L87 Difference]: Start difference. First operand 18418 states and 25091 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-01-09 04:42:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:47,073 INFO L93 Difference]: Finished difference Result 49820 states and 68395 transitions. [2025-01-09 04:42:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:47,074 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-01-09 04:42:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:47,118 INFO L225 Difference]: With dead ends: 49820 [2025-01-09 04:42:47,119 INFO L226 Difference]: Without dead ends: 33544 [2025-01-09 04:42:47,139 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-01-09 04:42:47,140 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 155 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:47,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 885 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33544 states. [2025-01-09 04:42:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33544 to 31634. [2025-01-09 04:42:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31634 states, 31633 states have (on average 1.361710871558183) internal successors, (43075), 31633 states have internal predecessors, (43075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31634 states to 31634 states and 43075 transitions. [2025-01-09 04:42:47,447 INFO L78 Accepts]: Start accepts. Automaton has 31634 states and 43075 transitions. Word has length 88 [2025-01-09 04:42:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:47,447 INFO L471 AbstractCegarLoop]: Abstraction has 31634 states and 43075 transitions. [2025-01-09 04:42:47,447 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-01-09 04:42:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31634 states and 43075 transitions. [2025-01-09 04:42:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:42:47,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:47,458 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-01-09 04:42:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:42:47,459 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:47,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 195252509, now seen corresponding path program 1 times [2025-01-09 04:42:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276194163] [2025-01-09 04:42:47,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:47,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:42:47,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:42:47,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:47,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:47,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276194163] [2025-01-09 04:42:47,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276194163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:47,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:47,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950928719] [2025-01-09 04:42:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:47,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:47,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:47,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:47,568 INFO L87 Difference]: Start difference. First operand 31634 states and 43075 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-01-09 04:42:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:47,760 INFO L93 Difference]: Finished difference Result 88698 states and 121081 transitions. [2025-01-09 04:42:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:47,760 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-01-09 04:42:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:47,819 INFO L225 Difference]: With dead ends: 88698 [2025-01-09 04:42:47,819 INFO L226 Difference]: Without dead ends: 59206 [2025-01-09 04:42:47,847 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-01-09 04:42:47,848 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 143 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:47,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 874 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59206 states. [2025-01-09 04:42:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59206 to 55236. [2025-01-09 04:42:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55236 states, 55235 states have (on average 1.350683443468815) internal successors, (74605), 55235 states have internal predecessors, (74605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55236 states to 55236 states and 74605 transitions. [2025-01-09 04:42:48,437 INFO L78 Accepts]: Start accepts. Automaton has 55236 states and 74605 transitions. Word has length 89 [2025-01-09 04:42:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 55236 states and 74605 transitions. [2025-01-09 04:42:48,438 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-01-09 04:42:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 55236 states and 74605 transitions. [2025-01-09 04:42:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:42:48,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:48,448 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-01-09 04:42:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:42:48,449 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1615072029, now seen corresponding path program 1 times [2025-01-09 04:42:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372834725] [2025-01-09 04:42:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:48,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:42:48,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:42:48,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372834725] [2025-01-09 04:42:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372834725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402879395] [2025-01-09 04:42:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:48,522 INFO L87 Difference]: Start difference. First operand 55236 states and 74605 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:48,690 INFO L93 Difference]: Finished difference Result 76385 states and 103200 transitions. [2025-01-09 04:42:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:42:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:48,738 INFO L225 Difference]: With dead ends: 76385 [2025-01-09 04:42:48,738 INFO L226 Difference]: Without dead ends: 45350 [2025-01-09 04:42:48,767 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-01-09 04:42:48,767 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 242 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:48,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 920 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45350 states. [2025-01-09 04:42:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45350 to 45348. [2025-01-09 04:42:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45348 states, 45347 states have (on average 1.3439698326239884) internal successors, (60945), 45347 states have internal predecessors, (60945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45348 states to 45348 states and 60945 transitions. [2025-01-09 04:42:49,477 INFO L78 Accepts]: Start accepts. Automaton has 45348 states and 60945 transitions. Word has length 90 [2025-01-09 04:42:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:49,478 INFO L471 AbstractCegarLoop]: Abstraction has 45348 states and 60945 transitions. [2025-01-09 04:42:49,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 45348 states and 60945 transitions. [2025-01-09 04:42:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:42:49,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:49,489 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-01-09 04:42:49,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:42:49,489 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:49,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -992280540, now seen corresponding path program 1 times [2025-01-09 04:42:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994002514] [2025-01-09 04:42:49,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:49,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:42:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:42:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994002514] [2025-01-09 04:42:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994002514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685945785] [2025-01-09 04:42:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:49,725 INFO L87 Difference]: Start difference. First operand 45348 states and 60945 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:49,982 INFO L93 Difference]: Finished difference Result 128848 states and 173083 transitions. [2025-01-09 04:42:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:42:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:50,075 INFO L225 Difference]: With dead ends: 128848 [2025-01-09 04:42:50,076 INFO L226 Difference]: Without dead ends: 85578 [2025-01-09 04:42:50,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:50,116 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 130 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:50,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 856 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85578 states. [2025-01-09 04:42:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85578 to 79368. [2025-01-09 04:42:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79368 states, 79367 states have (on average 1.326558897274686) internal successors, (105285), 79367 states have internal predecessors, (105285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79368 states to 79368 states and 105285 transitions. [2025-01-09 04:42:51,010 INFO L78 Accepts]: Start accepts. Automaton has 79368 states and 105285 transitions. Word has length 90 [2025-01-09 04:42:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:51,010 INFO L471 AbstractCegarLoop]: Abstraction has 79368 states and 105285 transitions. [2025-01-09 04:42:51,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 79368 states and 105285 transitions. [2025-01-09 04:42:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:42:51,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:51,016 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-01-09 04:42:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:42:51,016 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1918040975, now seen corresponding path program 1 times [2025-01-09 04:42:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018843766] [2025-01-09 04:42:51,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:42:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:42:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018843766] [2025-01-09 04:42:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018843766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738505464] [2025-01-09 04:42:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:51,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:51,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:51,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:51,085 INFO L87 Difference]: Start difference. First operand 79368 states and 105285 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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-01-09 04:42:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:51,472 INFO L93 Difference]: Finished difference Result 96730 states and 128464 transitions. [2025-01-09 04:42:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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-01-09 04:42:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:51,544 INFO L225 Difference]: With dead ends: 96730 [2025-01-09 04:42:51,544 INFO L226 Difference]: Without dead ends: 65510 [2025-01-09 04:42:51,561 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-01-09 04:42:51,561 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 199 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:51,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 888 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65510 states. [2025-01-09 04:42:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65510 to 65508. [2025-01-09 04:42:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65508 states, 65507 states have (on average 1.3272169386477781) internal successors, (86942), 65507 states have internal predecessors, (86942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65508 states to 65508 states and 86942 transitions. [2025-01-09 04:42:52,262 INFO L78 Accepts]: Start accepts. Automaton has 65508 states and 86942 transitions. Word has length 91 [2025-01-09 04:42:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:52,263 INFO L471 AbstractCegarLoop]: Abstraction has 65508 states and 86942 transitions. [2025-01-09 04:42:52,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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-01-09 04:42:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 65508 states and 86942 transitions. [2025-01-09 04:42:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:42:52,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:52,269 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] [2025-01-09 04:42:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:42:52,269 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1248064469, now seen corresponding path program 1 times [2025-01-09 04:42:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761959380] [2025-01-09 04:42:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:52,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:42:52,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:42:52,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761959380] [2025-01-09 04:42:52,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761959380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:52,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:52,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270160854] [2025-01-09 04:42:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:52,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:52,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:52,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:52,548 INFO L87 Difference]: Start difference. First operand 65508 states and 86942 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:53,235 INFO L93 Difference]: Finished difference Result 187416 states and 248400 transitions. [2025-01-09 04:42:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 04:42:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:53,391 INFO L225 Difference]: With dead ends: 187416 [2025-01-09 04:42:53,391 INFO L226 Difference]: Without dead ends: 123902 [2025-01-09 04:42:53,430 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-01-09 04:42:53,431 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 108 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:53,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 836 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123902 states. [2025-01-09 04:42:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123902 to 115964. [2025-01-09 04:42:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115964 states, 115963 states have (on average 1.3148159326681785) internal successors, (152470), 115963 states have internal predecessors, (152470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115964 states to 115964 states and 152470 transitions. [2025-01-09 04:42:54,779 INFO L78 Accepts]: Start accepts. Automaton has 115964 states and 152470 transitions. Word has length 92 [2025-01-09 04:42:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 115964 states and 152470 transitions. [2025-01-09 04:42:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 115964 states and 152470 transitions. [2025-01-09 04:42:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:42:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:54,789 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-01-09 04:42:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:42:54,789 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash -290315974, now seen corresponding path program 1 times [2025-01-09 04:42:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581257104] [2025-01-09 04:42:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:55,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:42:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:42:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581257104] [2025-01-09 04:42:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581257104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:55,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81770305] [2025-01-09 04:42:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:55,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:42:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:55,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:42:55,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:55,370 INFO L87 Difference]: Start difference. First operand 115964 states and 152470 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-01-09 04:42:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:55,794 INFO L93 Difference]: Finished difference Result 124798 states and 164247 transitions. [2025-01-09 04:42:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:55,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-01-09 04:42:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:55,953 INFO L225 Difference]: With dead ends: 124798 [2025-01-09 04:42:55,953 INFO L226 Difference]: Without dead ends: 124796 [2025-01-09 04:42:55,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:55,995 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2076 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124796 states. [2025-01-09 04:42:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124796 to 124796. [2025-01-09 04:42:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124796 states, 124795 states have (on average 1.2925357586441764) internal successors, (161302), 124795 states have internal predecessors, (161302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124796 states to 124796 states and 161302 transitions. [2025-01-09 04:42:57,631 INFO L78 Accepts]: Start accepts. Automaton has 124796 states and 161302 transitions. Word has length 94 [2025-01-09 04:42:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:57,632 INFO L471 AbstractCegarLoop]: Abstraction has 124796 states and 161302 transitions. [2025-01-09 04:42:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-01-09 04:42:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124796 states and 161302 transitions. [2025-01-09 04:42:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:42:57,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:57,639 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-01-09 04:42:57,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:42:57,639 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:42:57,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 95243205, now seen corresponding path program 1 times [2025-01-09 04:42:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:57,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821871297] [2025-01-09 04:42:57,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:57,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:42:57,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:42:57,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:57,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821871297] [2025-01-09 04:42:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821871297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542490184] [2025-01-09 04:42:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:57,771 INFO L87 Difference]: Start difference. First operand 124796 states and 161302 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-01-09 04:42:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:58,784 INFO L93 Difference]: Finished difference Result 314480 states and 404296 transitions. [2025-01-09 04:42:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:58,785 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-01-09 04:42:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:59,075 INFO L225 Difference]: With dead ends: 314480 [2025-01-09 04:42:59,075 INFO L226 Difference]: Without dead ends: 191678 [2025-01-09 04:42:59,143 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-01-09 04:42:59,144 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 326 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:59,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 612 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191678 states. [2025-01-09 04:43:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191678 to 191676. [2025-01-09 04:43:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191676 states, 191675 states have (on average 1.272268162253815) internal successors, (243862), 191675 states have internal predecessors, (243862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191676 states to 191676 states and 243862 transitions. [2025-01-09 04:43:01,833 INFO L78 Accepts]: Start accepts. Automaton has 191676 states and 243862 transitions. Word has length 95 [2025-01-09 04:43:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:01,833 INFO L471 AbstractCegarLoop]: Abstraction has 191676 states and 243862 transitions. [2025-01-09 04:43:01,833 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-01-09 04:43:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 191676 states and 243862 transitions. [2025-01-09 04:43:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:43:01,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:01,842 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-01-09 04:43:01,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:43:01,842 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1137070122, now seen corresponding path program 1 times [2025-01-09 04:43:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54046423] [2025-01-09 04:43:01,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:01,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:43:01,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:43:01,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:01,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:01,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:01,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54046423] [2025-01-09 04:43:01,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54046423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606103151] [2025-01-09 04:43:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:01,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:01,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:01,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:01,997 INFO L87 Difference]: Start difference. First operand 191676 states and 243862 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:03,237 INFO L93 Difference]: Finished difference Result 305934 states and 391043 transitions. [2025-01-09 04:43:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:43:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:03,628 INFO L225 Difference]: With dead ends: 305934 [2025-01-09 04:43:03,628 INFO L226 Difference]: Without dead ends: 266692 [2025-01-09 04:43:03,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:03,669 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 1585 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:03,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1312 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266692 states. [2025-01-09 04:43:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266692 to 221444. [2025-01-09 04:43:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221444 states, 221443 states have (on average 1.2705662405223919) internal successors, (281358), 221443 states have internal predecessors, (281358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221444 states to 221444 states and 281358 transitions. [2025-01-09 04:43:07,134 INFO L78 Accepts]: Start accepts. Automaton has 221444 states and 281358 transitions. Word has length 97 [2025-01-09 04:43:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:07,134 INFO L471 AbstractCegarLoop]: Abstraction has 221444 states and 281358 transitions. [2025-01-09 04:43:07,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 221444 states and 281358 transitions. [2025-01-09 04:43:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:43:07,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:07,144 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] [2025-01-09 04:43:07,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:43:07,144 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:07,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:07,145 INFO L85 PathProgramCache]: Analyzing trace with hash -66918083, now seen corresponding path program 1 times [2025-01-09 04:43:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:07,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235978033] [2025-01-09 04:43:07,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:07,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:43:07,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:43:07,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:07,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235978033] [2025-01-09 04:43:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235978033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735052883] [2025-01-09 04:43:07,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:07,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:07,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:07,259 INFO L87 Difference]: Start difference. First operand 221444 states and 281358 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:08,331 INFO L93 Difference]: Finished difference Result 439567 states and 558443 transitions. [2025-01-09 04:43:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:43:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:09,493 INFO L225 Difference]: With dead ends: 439567 [2025-01-09 04:43:09,493 INFO L226 Difference]: Without dead ends: 306846 [2025-01-09 04:43:09,595 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-01-09 04:43:09,596 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 376 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:09,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 569 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306846 states. [2025-01-09 04:43:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306846 to 217969. [2025-01-09 04:43:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217969 states, 217968 states have (on average 1.2674383395727813) internal successors, (276261), 217968 states have internal predecessors, (276261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217969 states to 217969 states and 276261 transitions. [2025-01-09 04:43:12,849 INFO L78 Accepts]: Start accepts. Automaton has 217969 states and 276261 transitions. Word has length 98 [2025-01-09 04:43:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 217969 states and 276261 transitions. [2025-01-09 04:43:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 217969 states and 276261 transitions. [2025-01-09 04:43:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:43:12,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:12,856 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] [2025-01-09 04:43:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:43:12,856 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:12,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1368723189, now seen corresponding path program 1 times [2025-01-09 04:43:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170825201] [2025-01-09 04:43:12,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:12,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:43:12,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:43:12,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:12,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:13,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170825201] [2025-01-09 04:43:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170825201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506228026] [2025-01-09 04:43:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:13,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:13,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:13,503 INFO L87 Difference]: Start difference. First operand 217969 states and 276261 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:14,344 INFO L93 Difference]: Finished difference Result 313187 states and 398546 transitions. [2025-01-09 04:43:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:43:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:14,814 INFO L225 Difference]: With dead ends: 313187 [2025-01-09 04:43:14,814 INFO L226 Difference]: Without dead ends: 275097 [2025-01-09 04:43:14,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:14,920 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1573 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:14,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275097 states. [2025-01-09 04:43:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275097 to 246969. [2025-01-09 04:43:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246969 states, 246968 states have (on average 1.265771274011208) internal successors, (312605), 246968 states have internal predecessors, (312605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246969 states to 246969 states and 312605 transitions. [2025-01-09 04:43:18,924 INFO L78 Accepts]: Start accepts. Automaton has 246969 states and 312605 transitions. Word has length 99 [2025-01-09 04:43:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:18,924 INFO L471 AbstractCegarLoop]: Abstraction has 246969 states and 312605 transitions. [2025-01-09 04:43:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 246969 states and 312605 transitions. [2025-01-09 04:43:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:43:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:18,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:43:18,960 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 279266524, now seen corresponding path program 1 times [2025-01-09 04:43:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:18,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560239903] [2025-01-09 04:43:18,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:18,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:43:18,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:43:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560239903] [2025-01-09 04:43:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560239903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:43:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928568318] [2025-01-09 04:43:19,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:43:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:43:19,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:43:19,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:43:20,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:43:20,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:43:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:20,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:20,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:43:20,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:43:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:43:20,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:43:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928568318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:43:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-01-09 04:43:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438122334] [2025-01-09 04:43:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:20,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:20,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:20,702 INFO L87 Difference]: Start difference. First operand 246969 states and 312605 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 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)