./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i --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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i -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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:23:57,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:23:57,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:23:57,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:23:57,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:23:57,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:23:57,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:23:57,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:23:57,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:23:57,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:23:57,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:23:57,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:23:57,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:23:57,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:23:57,849 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:23:57,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:23:57,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:23:57,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:23:57,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:23:57,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:23:57,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:23:57,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:57,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:57,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:57,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:57,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:23:57,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:57,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:23:57,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:23:57,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:23:57,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:23:57,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:23:57,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:23:57,853 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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2025-01-09 15:23:58,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:23:58,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:23:58,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:23:58,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:23:58,149 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:23:58,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2025-01-09 15:23:59,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5d753cc/1ccd16dd7dd843639de7b9b03b193ffa/FLAGb32ac0084 [2025-01-09 15:23:59,805 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:23:59,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2025-01-09 15:23:59,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5d753cc/1ccd16dd7dd843639de7b9b03b193ffa/FLAGb32ac0084 [2025-01-09 15:24:00,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5d753cc/1ccd16dd7dd843639de7b9b03b193ffa [2025-01-09 15:24:00,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:24:00,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:24:00,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:00,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:24:00,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:24:00,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d6927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00, skipping insertion in model container [2025-01-09 15:24:00,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:24:00,262 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2025-01-09 15:24:00,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:00,383 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:24:00,396 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2025-01-09 15:24:00,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:00,461 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:24:00,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00 WrapperNode [2025-01-09 15:24:00,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:00,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:00,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:24:00,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:24:00,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,541 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 572 [2025-01-09 15:24:00,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:00,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:24:00,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:24:00,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:24:00,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,586 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-01-09 15:24:00,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:24:00,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:24:00,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:24:00,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:24:00,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (1/1) ... [2025-01-09 15:24:00,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:00,677 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 15:24:00,684 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 15:24:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:24:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:24:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:24:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:24:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:24:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:24:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:24:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:24:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:24:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:24:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:24:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:24:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:24:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:24:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:24:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:24:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:24:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:24:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:24:00,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:24:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:24:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:24:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:24:00,842 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:24:00,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:24:01,371 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-01-09 15:24:01,371 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:24:01,386 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:24:01,387 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:24:01,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:01 BoogieIcfgContainer [2025-01-09 15:24:01,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:24:01,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:24:01,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:24:01,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:24:01,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:24:00" (1/3) ... [2025-01-09 15:24:01,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5ae925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:01, skipping insertion in model container [2025-01-09 15:24:01,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:00" (2/3) ... [2025-01-09 15:24:01,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5ae925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:01, skipping insertion in model container [2025-01-09 15:24:01,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:01" (3/3) ... [2025-01-09 15:24:01,394 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2025-01-09 15:24:01,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:24:01,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:24:01,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:24:01,467 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;@639580d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:24:01,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:24:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:24:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:01,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:01,483 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:01,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:01,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1231487151, now seen corresponding path program 1 times [2025-01-09 15:24:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631867949] [2025-01-09 15:24:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:01,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:01,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:24:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631867949] [2025-01-09 15:24:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631867949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262012448] [2025-01-09 15:24:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:01,847 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 15:24:01,850 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 15:24:02,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:02,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:02,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:02,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:24:02,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:24:02,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262012448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:24:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743067302] [2025-01-09 15:24:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:24:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:02,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:24:02,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:24:02,168 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:02,193 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-01-09 15:24:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:24:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 15:24:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:02,200 INFO L225 Difference]: With dead ends: 244 [2025-01-09 15:24:02,200 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:24:02,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:24:02,205 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:24:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:24:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:24:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-01-09 15:24:02,241 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-01-09 15:24:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:02,241 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-01-09 15:24:02,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-01-09 15:24:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:02,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:02,245 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:02,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:24:02,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:24:02,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:02,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1456886325, now seen corresponding path program 1 times [2025-01-09 15:24:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:02,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584522799] [2025-01-09 15:24:02,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:02,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:02,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:02,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:02,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584522799] [2025-01-09 15:24:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584522799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266176979] [2025-01-09 15:24:02,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:02,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:24:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:02,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:24:02,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:24:02,777 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:02,845 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2025-01-09 15:24:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:24:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:24:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:02,854 INFO L225 Difference]: With dead ends: 242 [2025-01-09 15:24:02,854 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 15:24:02,856 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 15:24:02,857 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:02,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 15:24:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 15:24:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:24:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-01-09 15:24:02,879 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2025-01-09 15:24:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-01-09 15:24:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-01-09 15:24:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:02,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:02,886 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:24:02,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 639237875, now seen corresponding path program 1 times [2025-01-09 15:24:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287158336] [2025-01-09 15:24:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:02,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:03,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:03,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287158336] [2025-01-09 15:24:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287158336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:24:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383949865] [2025-01-09 15:24:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:24:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:04,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:24:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:04,671 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:06,097 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2025-01-09 15:24:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:24:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:24:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:06,103 INFO L225 Difference]: With dead ends: 725 [2025-01-09 15:24:06,104 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 15:24:06,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:24:06,110 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 764 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:06,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1973 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:24:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 15:24:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2025-01-09 15:24:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 15:24:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2025-01-09 15:24:06,158 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2025-01-09 15:24:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2025-01-09 15:24:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2025-01-09 15:24:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:24:06,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,162 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:24:06,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1461419183, now seen corresponding path program 1 times [2025-01-09 15:24:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032278983] [2025-01-09 15:24:06,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:06,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:24:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:24:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:06,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032278983] [2025-01-09 15:24:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032278983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802209116] [2025-01-09 15:24:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:06,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:24:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:06,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:24:06,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:24:06,290 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:06,341 INFO L93 Difference]: Finished difference Result 766 states and 1155 transitions. [2025-01-09 15:24:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:24:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:24:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:06,348 INFO L225 Difference]: With dead ends: 766 [2025-01-09 15:24:06,348 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 15:24:06,349 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 15:24:06,350 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:06,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 15:24:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 15:24:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 336 states have (on average 1.443452380952381) internal successors, (485), 337 states have internal predecessors, (485), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 15:24:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 579 transitions. [2025-01-09 15:24:06,387 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 579 transitions. Word has length 152 [2025-01-09 15:24:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:06,388 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 579 transitions. [2025-01-09 15:24:06,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 579 transitions. [2025-01-09 15:24:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:24:06,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,391 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:06,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:24:06,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2134984349, now seen corresponding path program 1 times [2025-01-09 15:24:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20913219] [2025-01-09 15:24:06,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:06,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:24:06,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:24:06,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20913219] [2025-01-09 15:24:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20913219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768500416] [2025-01-09 15:24:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:06,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:24:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:24:06,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:24:06,516 INFO L87 Difference]: Start difference. First operand 387 states and 579 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:06,566 INFO L93 Difference]: Finished difference Result 768 states and 1151 transitions. [2025-01-09 15:24:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:24:06,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:24:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:06,572 INFO L225 Difference]: With dead ends: 768 [2025-01-09 15:24:06,572 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 15:24:06,573 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 15:24:06,574 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:06,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 15:24:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-01-09 15:24:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 15:24:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2025-01-09 15:24:06,600 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2025-01-09 15:24:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2025-01-09 15:24:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2025-01-09 15:24:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:24:06,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,603 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:24:06,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -214342925, now seen corresponding path program 1 times [2025-01-09 15:24:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601264685] [2025-01-09 15:24:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:06,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:24:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:24:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601264685] [2025-01-09 15:24:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601264685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037413378] [2025-01-09 15:24:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:24:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:24:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:24:06,707 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:06,751 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2025-01-09 15:24:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:24:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:24:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:06,756 INFO L225 Difference]: With dead ends: 760 [2025-01-09 15:24:06,756 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 15:24:06,759 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 15:24:06,761 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:06,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 15:24:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-01-09 15:24:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 15:24:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2025-01-09 15:24:06,795 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2025-01-09 15:24:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:06,796 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2025-01-09 15:24:06,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2025-01-09 15:24:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:06,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,799 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:24:06,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1102248104, now seen corresponding path program 1 times [2025-01-09 15:24:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067439846] [2025-01-09 15:24:06,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:06,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:06,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:06,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:24:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067439846] [2025-01-09 15:24:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067439846] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152915028] [2025-01-09 15:24:07,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:07,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:07,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:24:07,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:07,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:07,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:07,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:24:07,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:07,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152915028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:07,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:24:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058984731] [2025-01-09 15:24:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:07,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:07,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:07,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:07,319 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:07,360 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2025-01-09 15:24:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:24:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:07,364 INFO L225 Difference]: With dead ends: 764 [2025-01-09 15:24:07,364 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 15:24:07,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:07,368 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:07,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 15:24:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-01-09 15:24:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 15:24:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2025-01-09 15:24:07,402 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2025-01-09 15:24:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2025-01-09 15:24:07,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2025-01-09 15:24:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:07,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:07,407 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:07,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:07,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:07,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1965859603, now seen corresponding path program 1 times [2025-01-09 15:24:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176694854] [2025-01-09 15:24:07,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:07,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:07,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:07,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176694854] [2025-01-09 15:24:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176694854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:09,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784367419] [2025-01-09 15:24:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:09,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:09,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:09,270 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:09,808 INFO L93 Difference]: Finished difference Result 986 states and 1455 transitions. [2025-01-09 15:24:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:09,813 INFO L225 Difference]: With dead ends: 986 [2025-01-09 15:24:09,813 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 15:24:09,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:09,815 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 120 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:09,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1029 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 15:24:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 527. [2025-01-09 15:24:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:24:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2025-01-09 15:24:09,854 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 153 [2025-01-09 15:24:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2025-01-09 15:24:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2025-01-09 15:24:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:09,862 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:24:09,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1049244015, now seen corresponding path program 1 times [2025-01-09 15:24:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974309585] [2025-01-09 15:24:09,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:09,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:09,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974309585] [2025-01-09 15:24:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974309585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:24:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865302880] [2025-01-09 15:24:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:24:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:24:11,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:11,255 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:12,390 INFO L93 Difference]: Finished difference Result 1223 states and 1810 transitions. [2025-01-09 15:24:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:24:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:24:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:12,395 INFO L225 Difference]: With dead ends: 1223 [2025-01-09 15:24:12,395 INFO L226 Difference]: Without dead ends: 699 [2025-01-09 15:24:12,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:24:12,397 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 548 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:12,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1491 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:24:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-09 15:24:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 553. [2025-01-09 15:24:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 492 states have (on average 1.4451219512195121) internal successors, (711), 494 states have internal predecessors, (711), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:24:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 823 transitions. [2025-01-09 15:24:12,439 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 823 transitions. Word has length 153 [2025-01-09 15:24:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 823 transitions. [2025-01-09 15:24:12,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 823 transitions. [2025-01-09 15:24:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:12,443 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:12,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:24:12,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:12,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 462438001, now seen corresponding path program 1 times [2025-01-09 15:24:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992823351] [2025-01-09 15:24:12,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:12,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:13,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992823351] [2025-01-09 15:24:13,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992823351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:13,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:13,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:24:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111976194] [2025-01-09 15:24:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:13,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:24:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:13,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:24:13,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:13,948 INFO L87 Difference]: Start difference. First operand 553 states and 823 transitions. Second operand has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:15,625 INFO L93 Difference]: Finished difference Result 1328 states and 1955 transitions. [2025-01-09 15:24:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:24:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:15,632 INFO L225 Difference]: With dead ends: 1328 [2025-01-09 15:24:15,632 INFO L226 Difference]: Without dead ends: 778 [2025-01-09 15:24:15,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:24:15,636 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1090 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:15,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:24:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-01-09 15:24:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 629. [2025-01-09 15:24:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 553 states have (on average 1.4249547920433996) internal successors, (788), 556 states have internal predecessors, (788), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 926 transitions. [2025-01-09 15:24:15,689 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 926 transitions. Word has length 153 [2025-01-09 15:24:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 926 transitions. [2025-01-09 15:24:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 926 transitions. [2025-01-09 15:24:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:15,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:15,693 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:15,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:24:15,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1593385929, now seen corresponding path program 1 times [2025-01-09 15:24:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672758827] [2025-01-09 15:24:15,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:15,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:15,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:15,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:15,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:15,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672758827] [2025-01-09 15:24:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672758827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874609142] [2025-01-09 15:24:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:15,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:15,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:15,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:15,839 INFO L87 Difference]: Start difference. First operand 629 states and 926 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:15,944 INFO L93 Difference]: Finished difference Result 1284 states and 1891 transitions. [2025-01-09 15:24:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:15,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:24:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:15,951 INFO L225 Difference]: With dead ends: 1284 [2025-01-09 15:24:15,952 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 15:24:15,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:15,954 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:15,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:24:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 15:24:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 618. [2025-01-09 15:24:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 542 states have (on average 1.4132841328413284) internal successors, (766), 545 states have internal predecessors, (766), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 904 transitions. [2025-01-09 15:24:16,006 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 904 transitions. Word has length 153 [2025-01-09 15:24:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 904 transitions. [2025-01-09 15:24:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 904 transitions. [2025-01-09 15:24:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:16,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:16,009 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:16,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:24:16,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:16,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -511106055, now seen corresponding path program 1 times [2025-01-09 15:24:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:16,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145254601] [2025-01-09 15:24:16,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:16,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:16,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:16,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:16,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145254601] [2025-01-09 15:24:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145254601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:17,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693429392] [2025-01-09 15:24:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:17,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:17,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:17,058 INFO L87 Difference]: Start difference. First operand 618 states and 904 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:17,695 INFO L93 Difference]: Finished difference Result 1429 states and 2091 transitions. [2025-01-09 15:24:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:17,700 INFO L225 Difference]: With dead ends: 1429 [2025-01-09 15:24:17,701 INFO L226 Difference]: Without dead ends: 814 [2025-01-09 15:24:17,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:17,703 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 110 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:17,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1677 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-01-09 15:24:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 683. [2025-01-09 15:24:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 607 states have (on average 1.42668863261944) internal successors, (866), 610 states have internal predecessors, (866), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1004 transitions. [2025-01-09 15:24:17,746 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1004 transitions. Word has length 153 [2025-01-09 15:24:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1004 transitions. [2025-01-09 15:24:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1004 transitions. [2025-01-09 15:24:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:17,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:17,749 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:24:17,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1097912069, now seen corresponding path program 1 times [2025-01-09 15:24:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906887382] [2025-01-09 15:24:17,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:17,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:17,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906887382] [2025-01-09 15:24:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906887382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696579079] [2025-01-09 15:24:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:18,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:18,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:18,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:18,886 INFO L87 Difference]: Start difference. First operand 683 states and 1004 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:19,552 INFO L93 Difference]: Finished difference Result 1494 states and 2189 transitions. [2025-01-09 15:24:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:19,557 INFO L225 Difference]: With dead ends: 1494 [2025-01-09 15:24:19,558 INFO L226 Difference]: Without dead ends: 814 [2025-01-09 15:24:19,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:19,561 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 108 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1861 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-01-09 15:24:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 684. [2025-01-09 15:24:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 608 states have (on average 1.424342105263158) internal successors, (866), 611 states have internal predecessors, (866), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1004 transitions. [2025-01-09 15:24:19,609 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1004 transitions. Word has length 153 [2025-01-09 15:24:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1004 transitions. [2025-01-09 15:24:19,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1004 transitions. [2025-01-09 15:24:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:19,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:19,614 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:19,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:24:19,615 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1819634603, now seen corresponding path program 1 times [2025-01-09 15:24:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133291609] [2025-01-09 15:24:19,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:19,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:19,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:19,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133291609] [2025-01-09 15:24:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133291609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:24:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78278479] [2025-01-09 15:24:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:24:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:20,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:24:20,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:20,784 INFO L87 Difference]: Start difference. First operand 684 states and 1004 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:22,222 INFO L93 Difference]: Finished difference Result 1617 states and 2352 transitions. [2025-01-09 15:24:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:24:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:24:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:22,229 INFO L225 Difference]: With dead ends: 1617 [2025-01-09 15:24:22,229 INFO L226 Difference]: Without dead ends: 936 [2025-01-09 15:24:22,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:24:22,232 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 733 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:22,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2214 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:24:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-01-09 15:24:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 684. [2025-01-09 15:24:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 608 states have (on average 1.419407894736842) internal successors, (863), 611 states have internal predecessors, (863), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1001 transitions. [2025-01-09 15:24:22,282 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1001 transitions. Word has length 153 [2025-01-09 15:24:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:22,282 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1001 transitions. [2025-01-09 15:24:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1001 transitions. [2025-01-09 15:24:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:22,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:22,285 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:24:22,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash -47035089, now seen corresponding path program 1 times [2025-01-09 15:24:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236763722] [2025-01-09 15:24:22,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:22,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:22,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236763722] [2025-01-09 15:24:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236763722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866927921] [2025-01-09 15:24:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:23,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:23,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:23,255 INFO L87 Difference]: Start difference. First operand 684 states and 1001 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:23,835 INFO L93 Difference]: Finished difference Result 1508 states and 2203 transitions. [2025-01-09 15:24:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:24:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:23,841 INFO L225 Difference]: With dead ends: 1508 [2025-01-09 15:24:23,841 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 15:24:23,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:23,843 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 111 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1407 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 15:24:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 694. [2025-01-09 15:24:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 618 states have (on average 1.4255663430420713) internal successors, (881), 621 states have internal predecessors, (881), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1019 transitions. [2025-01-09 15:24:23,898 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1019 transitions. Word has length 153 [2025-01-09 15:24:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1019 transitions. [2025-01-09 15:24:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1019 transitions. [2025-01-09 15:24:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:23,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:23,901 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:23,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:24:23,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:23,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1020579145, now seen corresponding path program 1 times [2025-01-09 15:24:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:23,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25542008] [2025-01-09 15:24:23,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:23,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:23,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25542008] [2025-01-09 15:24:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25542008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:24:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352247280] [2025-01-09 15:24:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:24:25,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:25,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:24:25,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:25,347 INFO L87 Difference]: Start difference. First operand 694 states and 1019 transitions. Second operand has 12 states, 9 states have (on average 6.777777777777778) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:26,304 INFO L93 Difference]: Finished difference Result 1579 states and 2317 transitions. [2025-01-09 15:24:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:24:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.777777777777778) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:26,310 INFO L225 Difference]: With dead ends: 1579 [2025-01-09 15:24:26,310 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 15:24:26,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:24:26,313 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 109 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:26,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2041 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:24:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 15:24:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 754. [2025-01-09 15:24:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 678 states have (on average 1.4365781710914454) internal successors, (974), 681 states have internal predecessors, (974), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1112 transitions. [2025-01-09 15:24:26,352 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1112 transitions. Word has length 153 [2025-01-09 15:24:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:26,353 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1112 transitions. [2025-01-09 15:24:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.777777777777778) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1112 transitions. [2025-01-09 15:24:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:26,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:26,355 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:26,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:24:26,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:26,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1607385159, now seen corresponding path program 1 times [2025-01-09 15:24:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765950548] [2025-01-09 15:24:26,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:26,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:26,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:26,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:26,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:26,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:26,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765950548] [2025-01-09 15:24:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765950548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:26,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:24:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492111979] [2025-01-09 15:24:26,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:24:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:26,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:24:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:26,961 INFO L87 Difference]: Start difference. First operand 754 states and 1112 transitions. Second operand has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:27,900 INFO L93 Difference]: Finished difference Result 1606 states and 2357 transitions. [2025-01-09 15:24:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:24:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:24:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:27,906 INFO L225 Difference]: With dead ends: 1606 [2025-01-09 15:24:27,906 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 15:24:27,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:24:27,908 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 549 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:27,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1379 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:24:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 15:24:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 715. [2025-01-09 15:24:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 639 states have (on average 1.4272300469483568) internal successors, (912), 642 states have internal predecessors, (912), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1050 transitions. [2025-01-09 15:24:27,946 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1050 transitions. Word has length 153 [2025-01-09 15:24:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:27,947 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1050 transitions. [2025-01-09 15:24:27,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1050 transitions. [2025-01-09 15:24:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:27,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:27,950 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:24:27,950 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -958539531, now seen corresponding path program 1 times [2025-01-09 15:24:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578828600] [2025-01-09 15:24:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:28,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:28,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578828600] [2025-01-09 15:24:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578828600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267621327] [2025-01-09 15:24:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:28,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:28,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:28,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:28,823 INFO L87 Difference]: Start difference. First operand 715 states and 1050 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:29,411 INFO L93 Difference]: Finished difference Result 1624 states and 2375 transitions. [2025-01-09 15:24:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:29,416 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 15:24:29,417 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 15:24:29,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:29,419 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 110 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1729 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 15:24:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 694. [2025-01-09 15:24:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 618 states have (on average 1.4239482200647249) internal successors, (880), 621 states have internal predecessors, (880), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1018 transitions. [2025-01-09 15:24:29,460 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1018 transitions. Word has length 153 [2025-01-09 15:24:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:29,461 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1018 transitions. [2025-01-09 15:24:29,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1018 transitions. [2025-01-09 15:24:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:29,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:29,463 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:24:29,463 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1545345545, now seen corresponding path program 1 times [2025-01-09 15:24:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832583972] [2025-01-09 15:24:29,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:29,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:29,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832583972] [2025-01-09 15:24:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832583972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60149604] [2025-01-09 15:24:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:30,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:30,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:30,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:30,460 INFO L87 Difference]: Start difference. First operand 694 states and 1018 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:31,068 INFO L93 Difference]: Finished difference Result 1518 states and 2218 transitions. [2025-01-09 15:24:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:31,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:24:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:31,072 INFO L225 Difference]: With dead ends: 1518 [2025-01-09 15:24:31,073 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 15:24:31,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:31,075 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 108 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:31,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1881 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 15:24:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 632. [2025-01-09 15:24:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 556 states have (on average 1.408273381294964) internal successors, (783), 559 states have internal predecessors, (783), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 921 transitions. [2025-01-09 15:24:31,114 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 921 transitions. Word has length 153 [2025-01-09 15:24:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 921 transitions. [2025-01-09 15:24:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 921 transitions. [2025-01-09 15:24:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:24:31,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:31,117 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:24:31,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:31,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1443783325, now seen corresponding path program 1 times [2025-01-09 15:24:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:31,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100758447] [2025-01-09 15:24:31,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:31,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:24:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:24:31,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:31,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100758447] [2025-01-09 15:24:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100758447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023316118] [2025-01-09 15:24:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:31,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:31,224 INFO L87 Difference]: Start difference. First operand 632 states and 921 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:31,311 INFO L93 Difference]: Finished difference Result 1261 states and 1838 transitions. [2025-01-09 15:24:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:24:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:31,315 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 15:24:31,315 INFO L226 Difference]: Without dead ends: 632 [2025-01-09 15:24:31,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:31,317 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:31,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:24:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-01-09 15:24:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2025-01-09 15:24:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 554 states have (on average 1.4061371841155235) internal successors, (779), 557 states have internal predecessors, (779), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 917 transitions. [2025-01-09 15:24:31,351 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 917 transitions. Word has length 153 [2025-01-09 15:24:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 917 transitions. [2025-01-09 15:24:31,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 917 transitions. [2025-01-09 15:24:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:24:31,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:31,353 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:31,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:24:31,354 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:31,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2125062609, now seen corresponding path program 1 times [2025-01-09 15:24:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381646988] [2025-01-09 15:24:31,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:24:31,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:24:31,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:31,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381646988] [2025-01-09 15:24:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381646988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162692718] [2025-01-09 15:24:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:31,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:24:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:31,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:24:31,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:24:31,414 INFO L87 Difference]: Start difference. First operand 630 states and 917 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:31,462 INFO L93 Difference]: Finished difference Result 1247 states and 1815 transitions. [2025-01-09 15:24:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:24:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:24:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:31,466 INFO L225 Difference]: With dead ends: 1247 [2025-01-09 15:24:31,466 INFO L226 Difference]: Without dead ends: 620 [2025-01-09 15:24:31,467 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 15:24:31,468 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:31,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-01-09 15:24:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2025-01-09 15:24:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 544 states have (on average 1.3988970588235294) internal successors, (761), 547 states have internal predecessors, (761), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:24:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 899 transitions. [2025-01-09 15:24:31,506 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 899 transitions. Word has length 154 [2025-01-09 15:24:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:31,506 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 899 transitions. [2025-01-09 15:24:31,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 899 transitions. [2025-01-09 15:24:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:31,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:31,508 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:24:31,509 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1059450669, now seen corresponding path program 1 times [2025-01-09 15:24:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630256155] [2025-01-09 15:24:31,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:31,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:31,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630256155] [2025-01-09 15:24:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630256155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 15:24:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381758869] [2025-01-09 15:24:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:24:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:33,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:24:33,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:24:33,384 INFO L87 Difference]: Start difference. First operand 620 states and 899 transitions. Second operand has 20 states, 16 states have (on average 3.9375) internal successors, (63), 20 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:35,860 INFO L93 Difference]: Finished difference Result 1505 states and 2159 transitions. [2025-01-09 15:24:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 15:24:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 3.9375) internal successors, (63), 20 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2025-01-09 15:24:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:35,869 INFO L225 Difference]: With dead ends: 1505 [2025-01-09 15:24:35,869 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 15:24:35,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=2317, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 15:24:35,875 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1463 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:35,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 2891 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:24:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 15:24:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 714. [2025-01-09 15:24:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 621 states have (on average 1.3752012882447664) internal successors, (854), 625 states have internal predecessors, (854), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:24:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1022 transitions. [2025-01-09 15:24:35,928 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1022 transitions. Word has length 155 [2025-01-09 15:24:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:35,929 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1022 transitions. [2025-01-09 15:24:35,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 3.9375) internal successors, (63), 20 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1022 transitions. [2025-01-09 15:24:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:35,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:35,931 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:24:35,931 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:35,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -997411055, now seen corresponding path program 1 times [2025-01-09 15:24:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056179295] [2025-01-09 15:24:35,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:35,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:35,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:35,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:35,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056179295] [2025-01-09 15:24:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056179295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:24:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37788938] [2025-01-09 15:24:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:24:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:37,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:24:37,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:24:37,104 INFO L87 Difference]: Start difference. First operand 714 states and 1022 transitions. Second operand has 15 states, 12 states have (on average 5.25) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:38,416 INFO L93 Difference]: Finished difference Result 1630 states and 2317 transitions. [2025-01-09 15:24:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:24:38,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 5.25) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:24:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:38,421 INFO L225 Difference]: With dead ends: 1630 [2025-01-09 15:24:38,421 INFO L226 Difference]: Without dead ends: 919 [2025-01-09 15:24:38,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:24:38,424 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 729 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:38,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 2581 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:24:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-01-09 15:24:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 783. [2025-01-09 15:24:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 677 states have (on average 1.3633677991137372) internal successors, (923), 682 states have internal predecessors, (923), 95 states have call successors, (95), 10 states have call predecessors, (95), 10 states have return successors, (95), 90 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:24:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1113 transitions. [2025-01-09 15:24:38,495 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1113 transitions. Word has length 155 [2025-01-09 15:24:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:38,496 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1113 transitions. [2025-01-09 15:24:38,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 5.25) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:24:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1113 transitions. [2025-01-09 15:24:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:38,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:38,499 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:38,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:24:38,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 655186035, now seen corresponding path program 1 times [2025-01-09 15:24:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:38,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361998474] [2025-01-09 15:24:38,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:38,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:38,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:38,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361998474] [2025-01-09 15:24:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361998474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:24:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780974449] [2025-01-09 15:24:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:24:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:39,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:24:39,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:24:39,507 INFO L87 Difference]: Start difference. First operand 783 states and 1113 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:40,190 INFO L93 Difference]: Finished difference Result 1801 states and 2555 transitions. [2025-01-09 15:24:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:24:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:40,195 INFO L225 Difference]: With dead ends: 1801 [2025-01-09 15:24:40,195 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 15:24:40,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:24:40,198 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 132 mSDsluCounter, 2725 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:40,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2993 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 15:24:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 955. [2025-01-09 15:24:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 832 states have (on average 1.3641826923076923) internal successors, (1135), 838 states have internal predecessors, (1135), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 104 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 15:24:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1355 transitions. [2025-01-09 15:24:40,280 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1355 transitions. Word has length 155 [2025-01-09 15:24:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:40,281 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1355 transitions. [2025-01-09 15:24:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1355 transitions. [2025-01-09 15:24:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:40,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:40,283 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:40,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:24:40,283 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:40,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash 68380021, now seen corresponding path program 1 times [2025-01-09 15:24:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451514059] [2025-01-09 15:24:40,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:40,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:40,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451514059] [2025-01-09 15:24:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451514059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648836470] [2025-01-09 15:24:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:40,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:40,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:40,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:40,514 INFO L87 Difference]: Start difference. First operand 955 states and 1355 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:40,800 INFO L93 Difference]: Finished difference Result 2257 states and 3181 transitions. [2025-01-09 15:24:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:24:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:40,811 INFO L225 Difference]: With dead ends: 2257 [2025-01-09 15:24:40,812 INFO L226 Difference]: Without dead ends: 1305 [2025-01-09 15:24:40,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:40,814 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 100 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:40,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 592 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-01-09 15:24:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1188. [2025-01-09 15:24:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1020 states have (on average 1.3441176470588236) internal successors, (1371), 1029 states have internal predecessors, (1371), 149 states have call successors, (149), 18 states have call predecessors, (149), 18 states have return successors, (149), 140 states have call predecessors, (149), 149 states have call successors, (149) [2025-01-09 15:24:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1669 transitions. [2025-01-09 15:24:40,943 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1669 transitions. Word has length 155 [2025-01-09 15:24:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1669 transitions. [2025-01-09 15:24:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:24:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1669 transitions. [2025-01-09 15:24:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:40,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:40,946 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:40,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:24:40,946 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1211483657, now seen corresponding path program 1 times [2025-01-09 15:24:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538880551] [2025-01-09 15:24:40,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:40,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:41,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:41,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538880551] [2025-01-09 15:24:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538880551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:41,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:41,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353118705] [2025-01-09 15:24:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:41,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:41,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:41,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:41,948 INFO L87 Difference]: Start difference. First operand 1188 states and 1669 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:42,290 INFO L93 Difference]: Finished difference Result 2616 states and 3674 transitions. [2025-01-09 15:24:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:42,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:42,298 INFO L225 Difference]: With dead ends: 2616 [2025-01-09 15:24:42,298 INFO L226 Difference]: Without dead ends: 1431 [2025-01-09 15:24:42,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:42,302 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 121 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:42,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 740 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-01-09 15:24:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1159. [2025-01-09 15:24:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1005 states have (on average 1.3512437810945275) internal successors, (1358), 1013 states have internal predecessors, (1358), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 128 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 15:24:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1630 transitions. [2025-01-09 15:24:42,467 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1630 transitions. Word has length 155 [2025-01-09 15:24:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:42,467 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1630 transitions. [2025-01-09 15:24:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1630 transitions. [2025-01-09 15:24:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:42,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:42,472 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:42,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:24:42,472 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:42,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash 145712945, now seen corresponding path program 1 times [2025-01-09 15:24:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494547730] [2025-01-09 15:24:42,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:42,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:42,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494547730] [2025-01-09 15:24:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494547730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:43,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:24:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346852940] [2025-01-09 15:24:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:24:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:24:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:43,526 INFO L87 Difference]: Start difference. First operand 1159 states and 1630 transitions. Second operand has 13 states, 9 states have (on average 7.0) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:44,688 INFO L93 Difference]: Finished difference Result 2524 states and 3543 transitions. [2025-01-09 15:24:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:24:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.0) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2025-01-09 15:24:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:44,694 INFO L225 Difference]: With dead ends: 2524 [2025-01-09 15:24:44,694 INFO L226 Difference]: Without dead ends: 1368 [2025-01-09 15:24:44,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:24:44,697 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 593 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:44,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1740 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:24:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-01-09 15:24:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1138. [2025-01-09 15:24:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 984 states have (on average 1.3475609756097562) internal successors, (1326), 992 states have internal predecessors, (1326), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 128 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 15:24:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1598 transitions. [2025-01-09 15:24:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1598 transitions. Word has length 155 [2025-01-09 15:24:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:44,802 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1598 transitions. [2025-01-09 15:24:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.0) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1598 transitions. [2025-01-09 15:24:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:44,804 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:24:44,804 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1669800979, now seen corresponding path program 1 times [2025-01-09 15:24:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738458557] [2025-01-09 15:24:44,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:44,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738458557] [2025-01-09 15:24:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738458557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:45,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:24:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054151844] [2025-01-09 15:24:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:45,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:24:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:45,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:24:45,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:45,380 INFO L87 Difference]: Start difference. First operand 1138 states and 1598 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:45,752 INFO L93 Difference]: Finished difference Result 2216 states and 3122 transitions. [2025-01-09 15:24:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:24:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-01-09 15:24:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:45,760 INFO L225 Difference]: With dead ends: 2216 [2025-01-09 15:24:45,761 INFO L226 Difference]: Without dead ends: 1659 [2025-01-09 15:24:45,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:45,763 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 124 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:45,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1177 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-01-09 15:24:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1505. [2025-01-09 15:24:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1310 states have (on average 1.3595419847328245) internal successors, (1781), 1321 states have internal predecessors, (1781), 173 states have call successors, (173), 21 states have call predecessors, (173), 21 states have return successors, (173), 162 states have call predecessors, (173), 173 states have call successors, (173) [2025-01-09 15:24:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2127 transitions. [2025-01-09 15:24:45,887 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2127 transitions. Word has length 155 [2025-01-09 15:24:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:45,890 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2127 transitions. [2025-01-09 15:24:45,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2127 transitions. [2025-01-09 15:24:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:45,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:45,892 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:45,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:24:45,892 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:45,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 168345199, now seen corresponding path program 1 times [2025-01-09 15:24:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600621479] [2025-01-09 15:24:45,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:45,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:45,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:45,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600621479] [2025-01-09 15:24:47,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600621479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:47,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:47,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:24:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451912989] [2025-01-09 15:24:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:47,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:24:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:47,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:24:47,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:24:47,389 INFO L87 Difference]: Start difference. First operand 1505 states and 2127 transitions. Second operand has 14 states, 10 states have (on average 6.3) internal successors, (63), 14 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:49,144 INFO L93 Difference]: Finished difference Result 3204 states and 4518 transitions. [2025-01-09 15:24:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:24:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 6.3) internal successors, (63), 14 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2025-01-09 15:24:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:49,152 INFO L225 Difference]: With dead ends: 3204 [2025-01-09 15:24:49,152 INFO L226 Difference]: Without dead ends: 1702 [2025-01-09 15:24:49,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:24:49,155 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 521 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:49,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 3084 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:24:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-01-09 15:24:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1440. [2025-01-09 15:24:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1255 states have (on average 1.3609561752988049) internal successors, (1708), 1265 states have internal predecessors, (1708), 164 states have call successors, (164), 20 states have call predecessors, (164), 20 states have return successors, (164), 154 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 15:24:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2036 transitions. [2025-01-09 15:24:49,279 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2036 transitions. Word has length 155 [2025-01-09 15:24:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:49,279 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2036 transitions. [2025-01-09 15:24:49,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 6.3) internal successors, (63), 14 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 15:24:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2036 transitions. [2025-01-09 15:24:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:49,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:49,281 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:24:49,281 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1698324493, now seen corresponding path program 1 times [2025-01-09 15:24:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:49,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313781784] [2025-01-09 15:24:49,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:49,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:49,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313781784] [2025-01-09 15:24:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313781784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:24:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666628973] [2025-01-09 15:24:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:24:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:50,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:24:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:24:50,219 INFO L87 Difference]: Start difference. First operand 1440 states and 2036 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:51,045 INFO L93 Difference]: Finished difference Result 3263 states and 4594 transitions. [2025-01-09 15:24:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:24:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:51,052 INFO L225 Difference]: With dead ends: 3263 [2025-01-09 15:24:51,052 INFO L226 Difference]: Without dead ends: 1826 [2025-01-09 15:24:51,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:24:51,058 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 127 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:51,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 3295 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:24:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-01-09 15:24:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1443. [2025-01-09 15:24:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1258 states have (on average 1.3593004769475359) internal successors, (1710), 1268 states have internal predecessors, (1710), 164 states have call successors, (164), 20 states have call predecessors, (164), 20 states have return successors, (164), 154 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 15:24:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2038 transitions. [2025-01-09 15:24:51,216 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2038 transitions. Word has length 155 [2025-01-09 15:24:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:51,216 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2038 transitions. [2025-01-09 15:24:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2038 transitions. [2025-01-09 15:24:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:51,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:51,219 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:51,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:24:51,219 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1667450099, now seen corresponding path program 1 times [2025-01-09 15:24:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063791756] [2025-01-09 15:24:51,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:51,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:51,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:52,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063791756] [2025-01-09 15:24:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063791756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:24:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936455992] [2025-01-09 15:24:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:24:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:52,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:24:52,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:24:52,077 INFO L87 Difference]: Start difference. First operand 1443 states and 2038 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:52,718 INFO L93 Difference]: Finished difference Result 3178 states and 4491 transitions. [2025-01-09 15:24:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:24:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:52,725 INFO L225 Difference]: With dead ends: 3178 [2025-01-09 15:24:52,726 INFO L226 Difference]: Without dead ends: 1738 [2025-01-09 15:24:52,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:24:52,729 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 123 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:52,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2671 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-01-09 15:24:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1728. [2025-01-09 15:24:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1507 states have (on average 1.3603185136031852) internal successors, (2050), 1520 states have internal predecessors, (2050), 197 states have call successors, (197), 23 states have call predecessors, (197), 23 states have return successors, (197), 184 states have call predecessors, (197), 197 states have call successors, (197) [2025-01-09 15:24:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2444 transitions. [2025-01-09 15:24:52,868 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2444 transitions. Word has length 155 [2025-01-09 15:24:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2444 transitions. [2025-01-09 15:24:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2444 transitions. [2025-01-09 15:24:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:52,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:52,871 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:52,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:24:52,871 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:52,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1925615537, now seen corresponding path program 1 times [2025-01-09 15:24:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665308602] [2025-01-09 15:24:52,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:52,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:52,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:52,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665308602] [2025-01-09 15:24:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665308602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510223525] [2025-01-09 15:24:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:53,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:53,516 INFO L87 Difference]: Start difference. First operand 1728 states and 2444 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:53,846 INFO L93 Difference]: Finished difference Result 3724 states and 5271 transitions. [2025-01-09 15:24:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:53,854 INFO L225 Difference]: With dead ends: 3724 [2025-01-09 15:24:53,854 INFO L226 Difference]: Without dead ends: 1999 [2025-01-09 15:24:53,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:53,857 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 109 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:53,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1246 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-01-09 15:24:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1788. [2025-01-09 15:24:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1567 states have (on average 1.3631142310146778) internal successors, (2136), 1580 states have internal predecessors, (2136), 197 states have call successors, (197), 23 states have call predecessors, (197), 23 states have return successors, (197), 184 states have call predecessors, (197), 197 states have call successors, (197) [2025-01-09 15:24:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2530 transitions. [2025-01-09 15:24:53,993 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2530 transitions. Word has length 155 [2025-01-09 15:24:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2530 transitions. [2025-01-09 15:24:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2530 transitions. [2025-01-09 15:24:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:53,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:53,996 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:53,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:24:53,996 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 656332849, now seen corresponding path program 1 times [2025-01-09 15:24:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276976022] [2025-01-09 15:24:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:54,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276976022] [2025-01-09 15:24:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276976022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:54,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:24:54,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222145074] [2025-01-09 15:24:54,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:54,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:54,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:54,457 INFO L87 Difference]: Start difference. First operand 1788 states and 2530 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:54,771 INFO L93 Difference]: Finished difference Result 4014 states and 5679 transitions. [2025-01-09 15:24:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-01-09 15:24:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:54,781 INFO L225 Difference]: With dead ends: 4014 [2025-01-09 15:24:54,781 INFO L226 Difference]: Without dead ends: 2229 [2025-01-09 15:24:54,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:54,786 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 106 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:54,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1015 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-01-09 15:24:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2098. [2025-01-09 15:24:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 1837 states have (on average 1.360914534567229) internal successors, (2500), 1854 states have internal predecessors, (2500), 233 states have call successors, (233), 27 states have call predecessors, (233), 27 states have return successors, (233), 216 states have call predecessors, (233), 233 states have call successors, (233) [2025-01-09 15:24:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2966 transitions. [2025-01-09 15:24:54,929 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2966 transitions. Word has length 155 [2025-01-09 15:24:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:54,929 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2966 transitions. [2025-01-09 15:24:54,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:24:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2966 transitions. [2025-01-09 15:24:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:54,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:54,931 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:54,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:24:54,932 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:54,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash -704289163, now seen corresponding path program 1 times [2025-01-09 15:24:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:54,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300940974] [2025-01-09 15:24:54,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:54,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300940974] [2025-01-09 15:24:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300940974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206197416] [2025-01-09 15:24:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:55,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:55,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:55,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:55,474 INFO L87 Difference]: Start difference. First operand 2098 states and 2966 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:55,803 INFO L93 Difference]: Finished difference Result 4378 states and 6176 transitions. [2025-01-09 15:24:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:55,811 INFO L225 Difference]: With dead ends: 4378 [2025-01-09 15:24:55,811 INFO L226 Difference]: Without dead ends: 2283 [2025-01-09 15:24:55,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:55,814 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:55,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1049 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2025-01-09 15:24:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1706. [2025-01-09 15:24:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1516 states have (on average 1.3687335092348285) internal successors, (2075), 1527 states have internal predecessors, (2075), 167 states have call successors, (167), 22 states have call predecessors, (167), 22 states have return successors, (167), 156 states have call predecessors, (167), 167 states have call successors, (167) [2025-01-09 15:24:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2409 transitions. [2025-01-09 15:24:55,933 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2409 transitions. Word has length 155 [2025-01-09 15:24:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:55,933 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2409 transitions. [2025-01-09 15:24:55,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2409 transitions. [2025-01-09 15:24:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:55,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:55,935 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:55,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:24:55,935 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -446123725, now seen corresponding path program 1 times [2025-01-09 15:24:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537316321] [2025-01-09 15:24:55,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:55,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:55,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537316321] [2025-01-09 15:24:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537316321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:56,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:24:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421389670] [2025-01-09 15:24:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:24:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:56,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:24:56,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:24:56,633 INFO L87 Difference]: Start difference. First operand 1706 states and 2409 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:57,404 INFO L93 Difference]: Finished difference Result 3641 states and 5124 transitions. [2025-01-09 15:24:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:24:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:57,410 INFO L225 Difference]: With dead ends: 3641 [2025-01-09 15:24:57,410 INFO L226 Difference]: Without dead ends: 1938 [2025-01-09 15:24:57,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:24:57,413 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 117 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:57,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 3027 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-01-09 15:24:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1933. [2025-01-09 15:24:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1695 states have (on average 1.3563421828908555) internal successors, (2299), 1709 states have internal predecessors, (2299), 206 states have call successors, (206), 31 states have call predecessors, (206), 31 states have return successors, (206), 192 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 15:24:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2711 transitions. [2025-01-09 15:24:57,624 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2711 transitions. Word has length 155 [2025-01-09 15:24:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2711 transitions. [2025-01-09 15:24:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2711 transitions. [2025-01-09 15:24:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:57,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:57,626 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:57,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:24:57,626 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1241313803, now seen corresponding path program 1 times [2025-01-09 15:24:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585617909] [2025-01-09 15:24:57,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:57,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:57,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:57,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:57,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585617909] [2025-01-09 15:24:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585617909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939929283] [2025-01-09 15:24:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:58,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:58,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:58,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:58,011 INFO L87 Difference]: Start difference. First operand 1933 states and 2711 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:58,420 INFO L93 Difference]: Finished difference Result 3909 states and 5472 transitions. [2025-01-09 15:24:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:24:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:58,426 INFO L225 Difference]: With dead ends: 3909 [2025-01-09 15:24:58,427 INFO L226 Difference]: Without dead ends: 1979 [2025-01-09 15:24:58,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:58,431 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 108 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:58,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1067 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-01-09 15:24:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1766. [2025-01-09 15:24:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1555 states have (on average 1.3536977491961415) internal successors, (2105), 1566 states have internal predecessors, (2105), 179 states have call successors, (179), 31 states have call predecessors, (179), 31 states have return successors, (179), 168 states have call predecessors, (179), 179 states have call successors, (179) [2025-01-09 15:24:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2463 transitions. [2025-01-09 15:24:58,579 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2463 transitions. Word has length 155 [2025-01-09 15:24:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:58,580 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2463 transitions. [2025-01-09 15:24:58,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:24:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2463 transitions. [2025-01-09 15:24:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:24:58,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:58,581 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:24:58,582 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2042536243, now seen corresponding path program 1 times [2025-01-09 15:24:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507596605] [2025-01-09 15:24:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:24:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:24:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:24:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507596605] [2025-01-09 15:24:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507596605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:59,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:24:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006859123] [2025-01-09 15:24:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:59,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:24:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:59,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:24:59,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:24:59,660 INFO L87 Difference]: Start difference. First operand 1766 states and 2463 transitions. Second operand has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:01,194 INFO L93 Difference]: Finished difference Result 3072 states and 4289 transitions. [2025-01-09 15:25:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:25:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:25:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:01,198 INFO L225 Difference]: With dead ends: 3072 [2025-01-09 15:25:01,198 INFO L226 Difference]: Without dead ends: 1961 [2025-01-09 15:25:01,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:25:01,200 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 245 mSDsluCounter, 3420 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:01,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 3744 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:25:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-01-09 15:25:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1764. [2025-01-09 15:25:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1553 states have (on average 1.3541532517707662) internal successors, (2103), 1564 states have internal predecessors, (2103), 179 states have call successors, (179), 31 states have call predecessors, (179), 31 states have return successors, (179), 168 states have call predecessors, (179), 179 states have call successors, (179) [2025-01-09 15:25:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2461 transitions. [2025-01-09 15:25:01,323 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2461 transitions. Word has length 155 [2025-01-09 15:25:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2461 transitions. [2025-01-09 15:25:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:25:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2461 transitions. [2025-01-09 15:25:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:25:01,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:01,325 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:25:01,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:25:01,325 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:01,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1908522737, now seen corresponding path program 1 times [2025-01-09 15:25:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483648194] [2025-01-09 15:25:01,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:01,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:25:01,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:25:01,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:01,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:25:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483648194] [2025-01-09 15:25:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483648194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:25:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082773211] [2025-01-09 15:25:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:02,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:25:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:02,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:25:02,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:25:02,042 INFO L87 Difference]: Start difference. First operand 1764 states and 2461 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19)