/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:58:15,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:58:15,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:58:15,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:58:15,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:58:15,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:58:15,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:58:15,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:58:15,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:58:15,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:58:15,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:58:15,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:58:15,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:58:15,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:58:15,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:58:15,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:58:15,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:58:15,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:58:15,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:58:15,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:58:15,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:58:15,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:58:15,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:58:15,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:58:15,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:58:15,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:58:15,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:58:15,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:58:15,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:58:15,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:58:15,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:58:15,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:58:15,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:58:15,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:58:15,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:58:15,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:58:15,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:58:15,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:58:15,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:58:15,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:58:15,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:58:15,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:58:15,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:58:15,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:58:15,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:58:15,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:58:15,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:58:15,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:58:15,978 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:58:15,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:58:15,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:58:15,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:58:15,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:58:15,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:58:15,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:58:15,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:58:15,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:58:15,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:58:15,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:58:15,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:58:15,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:58:15,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:58:15,983 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:58:15,983 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:58:16,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:58:16,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:58:16,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:58:16,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:58:16,190 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:58:16,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-01-11 00:58:16,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bbedb7b/6df107f7926943ee9a488bd40b5aa501/FLAG4c694b33b [2022-01-11 00:58:16,614 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:58:16,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-01-11 00:58:16,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bbedb7b/6df107f7926943ee9a488bd40b5aa501/FLAG4c694b33b [2022-01-11 00:58:16,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bbedb7b/6df107f7926943ee9a488bd40b5aa501 [2022-01-11 00:58:17,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:58:17,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:58:17,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:58:17,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:58:17,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:58:17,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:58:16" (1/1) ... [2022-01-11 00:58:17,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f063959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17, skipping insertion in model container [2022-01-11 00:58:17,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:58:16" (1/1) ... [2022-01-11 00:58:17,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:58:17,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:58:17,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15593,15606] [2022-01-11 00:58:17,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16240,16253] [2022-01-11 00:58:17,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17624,17637] [2022-01-11 00:58:17,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18600,18613] [2022-01-11 00:58:17,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27965,27978] [2022-01-11 00:58:17,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:58:17,534 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:58:17,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15593,15606] [2022-01-11 00:58:17,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16240,16253] [2022-01-11 00:58:17,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17624,17637] [2022-01-11 00:58:17,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18600,18613] [2022-01-11 00:58:17,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27965,27978] [2022-01-11 00:58:17,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:58:17,729 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:58:17,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17 WrapperNode [2022-01-11 00:58:17,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:58:17,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:58:17,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:58:17,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:58:17,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,815 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1681 [2022-01-11 00:58:17,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:58:17,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:58:17,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:58:17,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:58:17,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:58:17,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:58:17,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:58:17,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:58:17,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (1/1) ... [2022-01-11 00:58:17,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:58:17,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:58:17,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:58:17,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:58:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:58:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:58:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:58:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:58:18,062 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:58:18,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:58:18,992 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:58:18,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:58:19,000 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:58:19,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:19 BoogieIcfgContainer [2022-01-11 00:58:19,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:58:19,002 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:58:19,002 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:58:19,003 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:58:19,005 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:19" (1/1) ... [2022-01-11 00:58:19,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:58:19 BasicIcfg [2022-01-11 00:58:19,530 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:58:19,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:58:19,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:58:19,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:58:19,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:58:16" (1/4) ... [2022-01-11 00:58:19,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae341cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:58:19, skipping insertion in model container [2022-01-11 00:58:19,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:17" (2/4) ... [2022-01-11 00:58:19,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae341cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:58:19, skipping insertion in model container [2022-01-11 00:58:19,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:19" (3/4) ... [2022-01-11 00:58:19,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae341cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:58:19, skipping insertion in model container [2022-01-11 00:58:19,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:58:19" (4/4) ... [2022-01-11 00:58:19,537 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.cTransformedIcfg [2022-01-11 00:58:19,541 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:58:19,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-11 00:58:19,597 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:58:19,601 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:58:19,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-11 00:58:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:58:19,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:19,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:19,641 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 688650408, now seen corresponding path program 1 times [2022-01-11 00:58:19,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939790442] [2022-01-11 00:58:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:19,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:20,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939790442] [2022-01-11 00:58:20,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939790442] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:20,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:20,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:20,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366961666] [2022-01-11 00:58:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:20,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:20,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:20,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:20,203 INFO L87 Difference]: Start difference. First operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:20,364 INFO L93 Difference]: Finished difference Result 1222 states and 2177 transitions. [2022-01-11 00:58:20,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-01-11 00:58:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:20,385 INFO L225 Difference]: With dead ends: 1222 [2022-01-11 00:58:20,386 INFO L226 Difference]: Without dead ends: 817 [2022-01-11 00:58:20,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:20,397 INFO L933 BasicCegarLoop]: 1218 mSDtfsCounter, 1636 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:20,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 1911 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-01-11 00:58:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 790. [2022-01-11 00:58:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 785 states have (on average 1.443312101910828) internal successors, (1133), 789 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1133 transitions. [2022-01-11 00:58:20,470 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1133 transitions. Word has length 150 [2022-01-11 00:58:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:20,471 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 1133 transitions. [2022-01-11 00:58:20,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1133 transitions. [2022-01-11 00:58:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-11 00:58:20,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:20,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:20,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:58:20,476 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -121240856, now seen corresponding path program 1 times [2022-01-11 00:58:20,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:20,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686656555] [2022-01-11 00:58:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:20,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:20,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:20,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686656555] [2022-01-11 00:58:20,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686656555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:20,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:20,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:20,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081277684] [2022-01-11 00:58:20,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:20,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:20,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:20,646 INFO L87 Difference]: Start difference. First operand 790 states and 1133 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:20,688 INFO L93 Difference]: Finished difference Result 2332 states and 3335 transitions. [2022-01-11 00:58:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:20,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-01-11 00:58:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:20,694 INFO L225 Difference]: With dead ends: 2332 [2022-01-11 00:58:20,694 INFO L226 Difference]: Without dead ends: 1570 [2022-01-11 00:58:20,695 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:20,696 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 594 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:20,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 1792 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-01-11 00:58:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 792. [2022-01-11 00:58:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 787 states have (on average 1.4421855146124523) internal successors, (1135), 791 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1135 transitions. [2022-01-11 00:58:20,739 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1135 transitions. Word has length 151 [2022-01-11 00:58:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:20,744 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1135 transitions. [2022-01-11 00:58:20,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1135 transitions. [2022-01-11 00:58:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-11 00:58:20,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:20,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:20,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:58:20,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash -240899901, now seen corresponding path program 1 times [2022-01-11 00:58:20,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:20,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297415729] [2022-01-11 00:58:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:20,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:20,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:20,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297415729] [2022-01-11 00:58:20,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297415729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:20,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:20,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:58:20,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932970054] [2022-01-11 00:58:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:20,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:58:20,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:58:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:20,890 INFO L87 Difference]: Start difference. First operand 792 states and 1135 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:21,079 INFO L93 Difference]: Finished difference Result 3071 states and 4380 transitions. [2022-01-11 00:58:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-11 00:58:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:21,086 INFO L225 Difference]: With dead ends: 3071 [2022-01-11 00:58:21,087 INFO L226 Difference]: Without dead ends: 2291 [2022-01-11 00:58:21,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:58:21,089 INFO L933 BasicCegarLoop]: 1379 mSDtfsCounter, 1702 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:21,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 3019 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:58:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2022-01-11 00:58:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 1506. [2022-01-11 00:58:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1501 states have (on average 1.4237175216522318) internal successors, (2137), 1505 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2137 transitions. [2022-01-11 00:58:21,160 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2137 transitions. Word has length 152 [2022-01-11 00:58:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:21,160 INFO L470 AbstractCegarLoop]: Abstraction has 1506 states and 2137 transitions. [2022-01-11 00:58:21,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2137 transitions. [2022-01-11 00:58:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-11 00:58:21,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:21,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:21,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:58:21,163 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash 506364455, now seen corresponding path program 1 times [2022-01-11 00:58:21,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329233540] [2022-01-11 00:58:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:21,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:21,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:21,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329233540] [2022-01-11 00:58:21,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329233540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:21,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:21,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:21,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037124256] [2022-01-11 00:58:21,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:21,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:21,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:21,243 INFO L87 Difference]: Start difference. First operand 1506 states and 2137 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:21,312 INFO L93 Difference]: Finished difference Result 2647 states and 3747 transitions. [2022-01-11 00:58:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-11 00:58:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:21,317 INFO L225 Difference]: With dead ends: 2647 [2022-01-11 00:58:21,317 INFO L226 Difference]: Without dead ends: 1157 [2022-01-11 00:58:21,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:21,323 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 69 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:21,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1850 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-01-11 00:58:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-01-11 00:58:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1152 states have (on average 1.4184027777777777) internal successors, (1634), 1156 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1634 transitions. [2022-01-11 00:58:21,372 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1634 transitions. Word has length 152 [2022-01-11 00:58:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:21,372 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1634 transitions. [2022-01-11 00:58:21,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1634 transitions. [2022-01-11 00:58:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-11 00:58:21,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:21,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:21,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:58:21,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1487491889, now seen corresponding path program 1 times [2022-01-11 00:58:21,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252552529] [2022-01-11 00:58:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:21,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:21,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252552529] [2022-01-11 00:58:21,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252552529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:21,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:21,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:21,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659019206] [2022-01-11 00:58:21,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:21,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:21,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:21,441 INFO L87 Difference]: Start difference. First operand 1157 states and 1634 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:21,493 INFO L93 Difference]: Finished difference Result 2325 states and 3264 transitions. [2022-01-11 00:58:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-11 00:58:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:21,498 INFO L225 Difference]: With dead ends: 2325 [2022-01-11 00:58:21,498 INFO L226 Difference]: Without dead ends: 1553 [2022-01-11 00:58:21,500 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:21,501 INFO L933 BasicCegarLoop]: 665 mSDtfsCounter, 586 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:21,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 1250 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2022-01-11 00:58:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1157. [2022-01-11 00:58:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1152 states have (on average 1.4175347222222223) internal successors, (1633), 1156 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1633 transitions. [2022-01-11 00:58:21,554 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1633 transitions. Word has length 155 [2022-01-11 00:58:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:21,554 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1633 transitions. [2022-01-11 00:58:21,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1633 transitions. [2022-01-11 00:58:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-11 00:58:21,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:21,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:21,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:58:21,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash 993865163, now seen corresponding path program 1 times [2022-01-11 00:58:21,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:21,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745929326] [2022-01-11 00:58:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:21,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:21,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:21,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745929326] [2022-01-11 00:58:21,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745929326] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:21,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:21,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:21,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584035346] [2022-01-11 00:58:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:21,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:21,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:21,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:21,668 INFO L87 Difference]: Start difference. First operand 1157 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:21,750 INFO L93 Difference]: Finished difference Result 2528 states and 3658 transitions. [2022-01-11 00:58:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-01-11 00:58:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:21,756 INFO L225 Difference]: With dead ends: 2528 [2022-01-11 00:58:21,756 INFO L226 Difference]: Without dead ends: 1551 [2022-01-11 00:58:21,759 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:21,760 INFO L933 BasicCegarLoop]: 806 mSDtfsCounter, 315 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:21,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 1277 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2022-01-11 00:58:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1381. [2022-01-11 00:58:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1376 states have (on average 1.4513081395348837) internal successors, (1997), 1380 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1997 transitions. [2022-01-11 00:58:21,830 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1997 transitions. Word has length 156 [2022-01-11 00:58:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:21,831 INFO L470 AbstractCegarLoop]: Abstraction has 1381 states and 1997 transitions. [2022-01-11 00:58:21,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1997 transitions. [2022-01-11 00:58:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-11 00:58:21,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:21,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:21,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:58:21,833 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 131774182, now seen corresponding path program 1 times [2022-01-11 00:58:21,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:21,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780571282] [2022-01-11 00:58:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:21,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:21,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780571282] [2022-01-11 00:58:21,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780571282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:21,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:21,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:21,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930857026] [2022-01-11 00:58:21,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:21,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:21,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:21,951 INFO L87 Difference]: Start difference. First operand 1381 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:22,084 INFO L93 Difference]: Finished difference Result 3698 states and 5377 transitions. [2022-01-11 00:58:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-01-11 00:58:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:22,092 INFO L225 Difference]: With dead ends: 3698 [2022-01-11 00:58:22,092 INFO L226 Difference]: Without dead ends: 2597 [2022-01-11 00:58:22,094 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:22,094 INFO L933 BasicCegarLoop]: 1116 mSDtfsCounter, 517 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:22,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 1658 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2022-01-11 00:58:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2576. [2022-01-11 00:58:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2571 states have (on average 1.4391287436795022) internal successors, (3700), 2575 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3700 transitions. [2022-01-11 00:58:22,247 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3700 transitions. Word has length 159 [2022-01-11 00:58:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:22,247 INFO L470 AbstractCegarLoop]: Abstraction has 2576 states and 3700 transitions. [2022-01-11 00:58:22,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3700 transitions. [2022-01-11 00:58:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-11 00:58:22,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:22,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:22,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:58:22,251 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:22,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -570821657, now seen corresponding path program 1 times [2022-01-11 00:58:22,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130916981] [2022-01-11 00:58:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:22,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:22,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130916981] [2022-01-11 00:58:22,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130916981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:22,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:22,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:22,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630379655] [2022-01-11 00:58:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:22,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:22,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:22,340 INFO L87 Difference]: Start difference. First operand 2576 states and 3700 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:22,559 INFO L93 Difference]: Finished difference Result 6431 states and 9227 transitions. [2022-01-11 00:58:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-01-11 00:58:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:22,591 INFO L225 Difference]: With dead ends: 6431 [2022-01-11 00:58:22,592 INFO L226 Difference]: Without dead ends: 3942 [2022-01-11 00:58:22,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:22,595 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 1157 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:22,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 1257 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2022-01-11 00:58:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 2581. [2022-01-11 00:58:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2576 states have (on average 1.437111801242236) internal successors, (3702), 2580 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3702 transitions. [2022-01-11 00:58:22,757 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3702 transitions. Word has length 159 [2022-01-11 00:58:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:22,757 INFO L470 AbstractCegarLoop]: Abstraction has 2581 states and 3702 transitions. [2022-01-11 00:58:22,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3702 transitions. [2022-01-11 00:58:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-11 00:58:22,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:22,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:22,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:58:22,760 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1637889839, now seen corresponding path program 1 times [2022-01-11 00:58:22,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:22,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945516259] [2022-01-11 00:58:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:22,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:22,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:22,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945516259] [2022-01-11 00:58:22,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945516259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:22,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:22,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:22,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019002808] [2022-01-11 00:58:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:22,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:22,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:22,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:22,859 INFO L87 Difference]: Start difference. First operand 2581 states and 3702 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:23,178 INFO L93 Difference]: Finished difference Result 7457 states and 10674 transitions. [2022-01-11 00:58:23,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:23,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-01-11 00:58:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:23,192 INFO L225 Difference]: With dead ends: 7457 [2022-01-11 00:58:23,193 INFO L226 Difference]: Without dead ends: 4944 [2022-01-11 00:58:23,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:23,197 INFO L933 BasicCegarLoop]: 976 mSDtfsCounter, 1257 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:23,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1257 Valid, 1524 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2022-01-11 00:58:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4906. [2022-01-11 00:58:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4901 states have (on average 1.4264435829422566) internal successors, (6991), 4905 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 6991 transitions. [2022-01-11 00:58:23,545 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 6991 transitions. Word has length 159 [2022-01-11 00:58:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:23,546 INFO L470 AbstractCegarLoop]: Abstraction has 4906 states and 6991 transitions. [2022-01-11 00:58:23,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 6991 transitions. [2022-01-11 00:58:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 00:58:23,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:23,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:23,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:58:23,552 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -514550584, now seen corresponding path program 1 times [2022-01-11 00:58:23,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808733645] [2022-01-11 00:58:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:23,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:23,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:23,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808733645] [2022-01-11 00:58:23,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808733645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:23,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:23,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:23,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425223803] [2022-01-11 00:58:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:23,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:23,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:23,661 INFO L87 Difference]: Start difference. First operand 4906 states and 6991 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:23,908 INFO L93 Difference]: Finished difference Result 7213 states and 10307 transitions. [2022-01-11 00:58:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-11 00:58:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:23,919 INFO L225 Difference]: With dead ends: 7213 [2022-01-11 00:58:23,919 INFO L226 Difference]: Without dead ends: 4106 [2022-01-11 00:58:23,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:23,922 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 47 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:23,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1825 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2022-01-11 00:58:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4106. [2022-01-11 00:58:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4106 states, 4101 states have (on average 1.4259936600829066) internal successors, (5848), 4105 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 5848 transitions. [2022-01-11 00:58:24,135 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 5848 transitions. Word has length 161 [2022-01-11 00:58:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:24,135 INFO L470 AbstractCegarLoop]: Abstraction has 4106 states and 5848 transitions. [2022-01-11 00:58:24,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5848 transitions. [2022-01-11 00:58:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 00:58:24,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:24,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:24,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:58:24,140 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2012450764, now seen corresponding path program 1 times [2022-01-11 00:58:24,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:24,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944185727] [2022-01-11 00:58:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:24,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:24,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:24,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944185727] [2022-01-11 00:58:24,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944185727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:24,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:24,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:58:24,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036784506] [2022-01-11 00:58:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:24,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:58:24,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:24,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:58:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:24,258 INFO L87 Difference]: Start difference. First operand 4106 states and 5848 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:24,642 INFO L93 Difference]: Finished difference Result 10807 states and 15343 transitions. [2022-01-11 00:58:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:24,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-11 00:58:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:24,666 INFO L225 Difference]: With dead ends: 10807 [2022-01-11 00:58:24,666 INFO L226 Difference]: Without dead ends: 6745 [2022-01-11 00:58:24,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:58:24,671 INFO L933 BasicCegarLoop]: 1373 mSDtfsCounter, 1688 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:24,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1688 Valid, 2974 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:58:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2022-01-11 00:58:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 4268. [2022-01-11 00:58:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4268 states, 4263 states have (on average 1.415669716162327) internal successors, (6035), 4267 states have internal predecessors, (6035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 6035 transitions. [2022-01-11 00:58:24,948 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 6035 transitions. Word has length 161 [2022-01-11 00:58:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:24,948 INFO L470 AbstractCegarLoop]: Abstraction has 4268 states and 6035 transitions. [2022-01-11 00:58:24,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 6035 transitions. [2022-01-11 00:58:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 00:58:24,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:24,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:24,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:58:24,954 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1075516336, now seen corresponding path program 1 times [2022-01-11 00:58:24,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612579328] [2022-01-11 00:58:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:24,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:25,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612579328] [2022-01-11 00:58:25,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612579328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:25,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:25,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:25,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457771519] [2022-01-11 00:58:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:25,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:25,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:25,046 INFO L87 Difference]: Start difference. First operand 4268 states and 6035 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:25,281 INFO L93 Difference]: Finished difference Result 7704 states and 10883 transitions. [2022-01-11 00:58:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-11 00:58:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:25,288 INFO L225 Difference]: With dead ends: 7704 [2022-01-11 00:58:25,288 INFO L226 Difference]: Without dead ends: 3472 [2022-01-11 00:58:25,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:25,294 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 47 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:25,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1820 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2022-01-11 00:58:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2022-01-11 00:58:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3467 states have (on average 1.4124603403518892) internal successors, (4897), 3471 states have internal predecessors, (4897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4897 transitions. [2022-01-11 00:58:25,503 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4897 transitions. Word has length 161 [2022-01-11 00:58:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:25,503 INFO L470 AbstractCegarLoop]: Abstraction has 3472 states and 4897 transitions. [2022-01-11 00:58:25,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4897 transitions. [2022-01-11 00:58:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-11 00:58:25,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:25,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:25,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:58:25,508 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1489523592, now seen corresponding path program 1 times [2022-01-11 00:58:25,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720833137] [2022-01-11 00:58:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:25,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:25,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:25,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720833137] [2022-01-11 00:58:25,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720833137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:25,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:25,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:25,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340813755] [2022-01-11 00:58:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:25,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:25,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:25,585 INFO L87 Difference]: Start difference. First operand 3472 states and 4897 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:25,791 INFO L93 Difference]: Finished difference Result 6882 states and 9717 transitions. [2022-01-11 00:58:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-11 00:58:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:25,800 INFO L225 Difference]: With dead ends: 6882 [2022-01-11 00:58:25,800 INFO L226 Difference]: Without dead ends: 4806 [2022-01-11 00:58:25,803 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:25,804 INFO L933 BasicCegarLoop]: 932 mSDtfsCounter, 571 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:25,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 1512 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2022-01-11 00:58:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 3472. [2022-01-11 00:58:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3467 states have (on average 1.4115950389385636) internal successors, (4894), 3471 states have internal predecessors, (4894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4894 transitions. [2022-01-11 00:58:26,021 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4894 transitions. Word has length 164 [2022-01-11 00:58:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:26,021 INFO L470 AbstractCegarLoop]: Abstraction has 3472 states and 4894 transitions. [2022-01-11 00:58:26,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4894 transitions. [2022-01-11 00:58:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 00:58:26,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:26,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:26,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:58:26,025 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2128452248, now seen corresponding path program 1 times [2022-01-11 00:58:26,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:26,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315127503] [2022-01-11 00:58:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:26,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:26,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:26,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315127503] [2022-01-11 00:58:26,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315127503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:26,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:26,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:26,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313347837] [2022-01-11 00:58:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:26,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:26,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:26,129 INFO L87 Difference]: Start difference. First operand 3472 states and 4894 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:26,388 INFO L93 Difference]: Finished difference Result 7933 states and 11523 transitions. [2022-01-11 00:58:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-11 00:58:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:26,397 INFO L225 Difference]: With dead ends: 7933 [2022-01-11 00:58:26,397 INFO L226 Difference]: Without dead ends: 4984 [2022-01-11 00:58:26,400 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:26,401 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 316 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:26,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1257 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-01-11 00:58:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4485. [2022-01-11 00:58:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4480 states have (on average 1.4533482142857144) internal successors, (6511), 4484 states have internal predecessors, (6511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6511 transitions. [2022-01-11 00:58:26,651 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6511 transitions. Word has length 165 [2022-01-11 00:58:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:26,651 INFO L470 AbstractCegarLoop]: Abstraction has 4485 states and 6511 transitions. [2022-01-11 00:58:26,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6511 transitions. [2022-01-11 00:58:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 00:58:26,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:26,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:26,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:58:26,655 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1482522668, now seen corresponding path program 1 times [2022-01-11 00:58:26,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:26,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814976813] [2022-01-11 00:58:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:26,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:26,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814976813] [2022-01-11 00:58:26,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814976813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:26,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:26,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:26,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026289195] [2022-01-11 00:58:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:26,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:26,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:26,758 INFO L87 Difference]: Start difference. First operand 4485 states and 6511 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:27,196 INFO L93 Difference]: Finished difference Result 10818 states and 15849 transitions. [2022-01-11 00:58:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2022-01-11 00:58:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:27,210 INFO L225 Difference]: With dead ends: 10818 [2022-01-11 00:58:27,210 INFO L226 Difference]: Without dead ends: 6996 [2022-01-11 00:58:27,216 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:27,216 INFO L933 BasicCegarLoop]: 1097 mSDtfsCounter, 505 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:27,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 1639 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2022-01-11 00:58:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6961. [2022-01-11 00:58:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6961 states, 6956 states have (on average 1.4424956871765382) internal successors, (10034), 6960 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 10034 transitions. [2022-01-11 00:58:27,695 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 10034 transitions. Word has length 168 [2022-01-11 00:58:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:27,695 INFO L470 AbstractCegarLoop]: Abstraction has 6961 states and 10034 transitions. [2022-01-11 00:58:27,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 10034 transitions. [2022-01-11 00:58:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 00:58:27,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:27,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:27,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:58:27,700 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 880576840, now seen corresponding path program 1 times [2022-01-11 00:58:27,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:27,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103317009] [2022-01-11 00:58:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:27,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:27,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103317009] [2022-01-11 00:58:27,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103317009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:27,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:27,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:27,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635183472] [2022-01-11 00:58:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:27,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:27,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:27,810 INFO L87 Difference]: Start difference. First operand 6961 states and 10034 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:28,370 INFO L93 Difference]: Finished difference Result 16790 states and 24368 transitions. [2022-01-11 00:58:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2022-01-11 00:58:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:28,389 INFO L225 Difference]: With dead ends: 16790 [2022-01-11 00:58:28,389 INFO L226 Difference]: Without dead ends: 10795 [2022-01-11 00:58:28,398 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:28,398 INFO L933 BasicCegarLoop]: 1075 mSDtfsCounter, 511 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:28,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 1612 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2022-01-11 00:58:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10760. [2022-01-11 00:58:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10760 states, 10755 states have (on average 1.4272431427243142) internal successors, (15350), 10759 states have internal predecessors, (15350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 15350 transitions. [2022-01-11 00:58:29,035 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 15350 transitions. Word has length 168 [2022-01-11 00:58:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:29,035 INFO L470 AbstractCegarLoop]: Abstraction has 10760 states and 15350 transitions. [2022-01-11 00:58:29,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 15350 transitions. [2022-01-11 00:58:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:58:29,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:29,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:29,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:58:29,043 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1145695060, now seen corresponding path program 1 times [2022-01-11 00:58:29,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:29,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760895520] [2022-01-11 00:58:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:29,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:29,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:29,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760895520] [2022-01-11 00:58:29,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760895520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:29,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:29,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:29,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99570865] [2022-01-11 00:58:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:29,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:29,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:29,137 INFO L87 Difference]: Start difference. First operand 10760 states and 15350 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:29,989 INFO L93 Difference]: Finished difference Result 24434 states and 35575 transitions. [2022-01-11 00:58:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-11 00:58:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:30,019 INFO L225 Difference]: With dead ends: 24434 [2022-01-11 00:58:30,019 INFO L226 Difference]: Without dead ends: 16066 [2022-01-11 00:58:30,031 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:30,031 INFO L933 BasicCegarLoop]: 827 mSDtfsCounter, 343 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:30,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1269 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16066 states. [2022-01-11 00:58:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16066 to 14565. [2022-01-11 00:58:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14565 states, 14560 states have (on average 1.4626373626373625) internal successors, (21296), 14564 states have internal predecessors, (21296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 21296 transitions. [2022-01-11 00:58:31,191 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 21296 transitions. Word has length 172 [2022-01-11 00:58:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:31,192 INFO L470 AbstractCegarLoop]: Abstraction has 14565 states and 21296 transitions. [2022-01-11 00:58:31,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 21296 transitions. [2022-01-11 00:58:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-01-11 00:58:31,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:31,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:31,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:58:31,203 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1528351186, now seen corresponding path program 1 times [2022-01-11 00:58:31,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:31,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603747978] [2022-01-11 00:58:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:31,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:31,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:31,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603747978] [2022-01-11 00:58:31,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603747978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:31,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:31,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:31,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939463209] [2022-01-11 00:58:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:31,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:31,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:31,352 INFO L87 Difference]: Start difference. First operand 14565 states and 21296 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:32,327 INFO L93 Difference]: Finished difference Result 29170 states and 42639 transitions. [2022-01-11 00:58:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2022-01-11 00:58:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:32,353 INFO L225 Difference]: With dead ends: 29170 [2022-01-11 00:58:32,353 INFO L226 Difference]: Without dead ends: 14762 [2022-01-11 00:58:32,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:32,371 INFO L933 BasicCegarLoop]: 1011 mSDtfsCounter, 1155 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:32,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1155 Valid, 1546 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14762 states. [2022-01-11 00:58:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14762 to 14667. [2022-01-11 00:58:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14667 states, 14662 states have (on average 1.45982812713136) internal successors, (21404), 14666 states have internal predecessors, (21404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14667 states to 14667 states and 21404 transitions. [2022-01-11 00:58:33,319 INFO L78 Accepts]: Start accepts. Automaton has 14667 states and 21404 transitions. Word has length 173 [2022-01-11 00:58:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:33,319 INFO L470 AbstractCegarLoop]: Abstraction has 14667 states and 21404 transitions. [2022-01-11 00:58:33,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14667 states and 21404 transitions. [2022-01-11 00:58:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-01-11 00:58:33,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:33,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:33,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:58:33,326 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -211479608, now seen corresponding path program 1 times [2022-01-11 00:58:33,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:33,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881596483] [2022-01-11 00:58:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:33,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:33,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:33,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881596483] [2022-01-11 00:58:33,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881596483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:33,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:33,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:58:33,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231153230] [2022-01-11 00:58:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:33,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:58:33,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:33,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:58:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:58:33,390 INFO L87 Difference]: Start difference. First operand 14667 states and 21404 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:35,210 INFO L93 Difference]: Finished difference Result 39687 states and 58097 transitions. [2022-01-11 00:58:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:58:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-01-11 00:58:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:35,256 INFO L225 Difference]: With dead ends: 39687 [2022-01-11 00:58:35,256 INFO L226 Difference]: Without dead ends: 29125 [2022-01-11 00:58:35,270 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:58:35,270 INFO L933 BasicCegarLoop]: 1148 mSDtfsCounter, 560 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:35,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1730 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29125 states. [2022-01-11 00:58:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29125 to 14677. [2022-01-11 00:58:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14677 states, 14672 states have (on average 1.459514721919302) internal successors, (21414), 14676 states have internal predecessors, (21414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14677 states to 14677 states and 21414 transitions. [2022-01-11 00:58:36,432 INFO L78 Accepts]: Start accepts. Automaton has 14677 states and 21414 transitions. Word has length 174 [2022-01-11 00:58:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:36,432 INFO L470 AbstractCegarLoop]: Abstraction has 14677 states and 21414 transitions. [2022-01-11 00:58:36,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14677 states and 21414 transitions. [2022-01-11 00:58:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-11 00:58:36,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:36,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:36,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:58:36,439 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:36,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash -802601677, now seen corresponding path program 1 times [2022-01-11 00:58:36,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:36,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030544836] [2022-01-11 00:58:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:36,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:36,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030544836] [2022-01-11 00:58:36,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030544836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:36,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:36,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:58:36,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084404198] [2022-01-11 00:58:36,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:36,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:58:36,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:58:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:36,600 INFO L87 Difference]: Start difference. First operand 14677 states and 21414 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:38,344 INFO L93 Difference]: Finished difference Result 38167 states and 55706 transitions. [2022-01-11 00:58:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2022-01-11 00:58:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:38,378 INFO L225 Difference]: With dead ends: 38167 [2022-01-11 00:58:38,378 INFO L226 Difference]: Without dead ends: 24580 [2022-01-11 00:58:38,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:58:38,390 INFO L933 BasicCegarLoop]: 1426 mSDtfsCounter, 1646 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:38,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1646 Valid, 3037 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:58:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24580 states. [2022-01-11 00:58:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24580 to 14935. [2022-01-11 00:58:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14935 states, 14930 states have (on average 1.4529135967849967) internal successors, (21692), 14934 states have internal predecessors, (21692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14935 states to 14935 states and 21692 transitions. [2022-01-11 00:58:39,596 INFO L78 Accepts]: Start accepts. Automaton has 14935 states and 21692 transitions. Word has length 175 [2022-01-11 00:58:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:39,596 INFO L470 AbstractCegarLoop]: Abstraction has 14935 states and 21692 transitions. [2022-01-11 00:58:39,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14935 states and 21692 transitions. [2022-01-11 00:58:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-11 00:58:39,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:39,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:39,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:58:39,603 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash 697978447, now seen corresponding path program 1 times [2022-01-11 00:58:39,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:39,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146642345] [2022-01-11 00:58:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:39,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:39,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:39,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146642345] [2022-01-11 00:58:39,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146642345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:39,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:39,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477488368] [2022-01-11 00:58:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:39,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:39,680 INFO L87 Difference]: Start difference. First operand 14935 states and 21692 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:40,687 INFO L93 Difference]: Finished difference Result 24456 states and 35620 transitions. [2022-01-11 00:58:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2022-01-11 00:58:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:40,705 INFO L225 Difference]: With dead ends: 24456 [2022-01-11 00:58:40,705 INFO L226 Difference]: Without dead ends: 13449 [2022-01-11 00:58:40,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:40,714 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 23 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:40,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1781 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13449 states. [2022-01-11 00:58:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13449 to 13449. [2022-01-11 00:58:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13449 states, 13444 states have (on average 1.4564117822076763) internal successors, (19580), 13448 states have internal predecessors, (19580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13449 states to 13449 states and 19580 transitions. [2022-01-11 00:58:41,684 INFO L78 Accepts]: Start accepts. Automaton has 13449 states and 19580 transitions. Word has length 175 [2022-01-11 00:58:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:41,685 INFO L470 AbstractCegarLoop]: Abstraction has 13449 states and 19580 transitions. [2022-01-11 00:58:41,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13449 states and 19580 transitions. [2022-01-11 00:58:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-11 00:58:41,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:41,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:41,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:58:41,691 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 215885238, now seen corresponding path program 1 times [2022-01-11 00:58:41,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562191444] [2022-01-11 00:58:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:41,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:41,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:41,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562191444] [2022-01-11 00:58:41,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562191444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:41,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:41,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:41,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899841254] [2022-01-11 00:58:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:41,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:41,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:41,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:41,800 INFO L87 Difference]: Start difference. First operand 13449 states and 19580 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:43,845 INFO L93 Difference]: Finished difference Result 38139 states and 56554 transitions. [2022-01-11 00:58:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2022-01-11 00:58:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:43,887 INFO L225 Difference]: With dead ends: 38139 [2022-01-11 00:58:43,887 INFO L226 Difference]: Without dead ends: 27003 [2022-01-11 00:58:43,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:43,900 INFO L933 BasicCegarLoop]: 1243 mSDtfsCounter, 853 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:43,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [853 Valid, 2792 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27003 states. [2022-01-11 00:58:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27003 to 14049. [2022-01-11 00:58:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14049 states, 14044 states have (on average 1.4433209911706066) internal successors, (20270), 14048 states have internal predecessors, (20270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14049 states to 14049 states and 20270 transitions. [2022-01-11 00:58:45,134 INFO L78 Accepts]: Start accepts. Automaton has 14049 states and 20270 transitions. Word has length 177 [2022-01-11 00:58:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:45,134 INFO L470 AbstractCegarLoop]: Abstraction has 14049 states and 20270 transitions. [2022-01-11 00:58:45,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14049 states and 20270 transitions. [2022-01-11 00:58:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-11 00:58:45,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:45,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:45,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:58:45,141 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1423803413, now seen corresponding path program 1 times [2022-01-11 00:58:45,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:45,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107694243] [2022-01-11 00:58:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:45,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:45,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107694243] [2022-01-11 00:58:45,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107694243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:45,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:45,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:45,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33530854] [2022-01-11 00:58:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:45,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:45,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:45,261 INFO L87 Difference]: Start difference. First operand 14049 states and 20270 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:47,557 INFO L93 Difference]: Finished difference Result 38857 states and 57284 transitions. [2022-01-11 00:58:47,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2022-01-11 00:58:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:47,597 INFO L225 Difference]: With dead ends: 38857 [2022-01-11 00:58:47,598 INFO L226 Difference]: Without dead ends: 27962 [2022-01-11 00:58:47,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:47,608 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 863 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:47,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [863 Valid, 2734 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27962 states. [2022-01-11 00:58:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27962 to 15222. [2022-01-11 00:58:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15222 states, 15217 states have (on average 1.4223565748833542) internal successors, (21644), 15221 states have internal predecessors, (21644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15222 states to 15222 states and 21644 transitions. [2022-01-11 00:58:48,936 INFO L78 Accepts]: Start accepts. Automaton has 15222 states and 21644 transitions. Word has length 177 [2022-01-11 00:58:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:48,936 INFO L470 AbstractCegarLoop]: Abstraction has 15222 states and 21644 transitions. [2022-01-11 00:58:48,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 15222 states and 21644 transitions. [2022-01-11 00:58:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-11 00:58:48,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:48,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:48,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:58:48,944 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1843320244, now seen corresponding path program 1 times [2022-01-11 00:58:48,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:48,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352542703] [2022-01-11 00:58:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:48,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:49,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:49,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352542703] [2022-01-11 00:58:49,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352542703] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:49,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:49,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:49,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385465391] [2022-01-11 00:58:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:49,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:49,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:49,072 INFO L87 Difference]: Start difference. First operand 15222 states and 21644 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:51,476 INFO L93 Difference]: Finished difference Result 40620 states and 59268 transitions. [2022-01-11 00:58:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2022-01-11 00:58:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:51,518 INFO L225 Difference]: With dead ends: 40620 [2022-01-11 00:58:51,519 INFO L226 Difference]: Without dead ends: 29966 [2022-01-11 00:58:51,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:51,536 INFO L933 BasicCegarLoop]: 1197 mSDtfsCounter, 927 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:51,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 2675 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:58:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29966 states. [2022-01-11 00:58:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29966 to 17273. [2022-01-11 00:58:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17273 states, 17268 states have (on average 1.392517952281677) internal successors, (24046), 17272 states have internal predecessors, (24046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 24046 transitions. [2022-01-11 00:58:53,109 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 24046 transitions. Word has length 177 [2022-01-11 00:58:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:53,110 INFO L470 AbstractCegarLoop]: Abstraction has 17273 states and 24046 transitions. [2022-01-11 00:58:53,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:58:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 24046 transitions. [2022-01-11 00:58:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-11 00:58:53,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:53,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:58:53,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:58:53,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:58:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1497418157, now seen corresponding path program 1 times [2022-01-11 00:58:53,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:53,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352540114] [2022-01-11 00:58:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:53,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:58:54,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:54,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352540114] [2022-01-11 00:58:54,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352540114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:54,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:54,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-11 00:58:54,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430143767] [2022-01-11 00:58:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:54,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-11 00:58:54,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-11 00:58:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-01-11 00:58:54,156 INFO L87 Difference]: Start difference. First operand 17273 states and 24046 transitions. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 14 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)