/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/openssl-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:42:28,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:42:28,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:42:28,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:42:28,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:42:28,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:42:28,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:42:28,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:42:28,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:42:28,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:42:28,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:42:28,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:42:28,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:42:28,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:42:28,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:42:28,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:42:28,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:42:28,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:42:28,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:42:28,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:42:28,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:42:28,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:42:28,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:42:28,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:42:28,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:42:28,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:42:28,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:42:28,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:42:28,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:42:28,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:42:28,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:42:28,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:42:28,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:42:28,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:42:28,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:42:28,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:42:28,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:42:28,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:42:28,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:42:28,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:42:28,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:42:28,950 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-10 21:42:28,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:42:28,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:42:28,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:42:28,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:42:28,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:42:28,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:42:28,985 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:42:28,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:42:28,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:42:28,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:42:28,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:42:28,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:42:28,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:42:28,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:42:28,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:42:28,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:28,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:42:28,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:42:28,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:42:28,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:42:28,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:42:28,989 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:42:28,990 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-10 21:42:29,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:42:29,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:42:29,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:42:29,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:42:29,229 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:42:29,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c [2022-01-10 21:42:29,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700ba69bb/7ab88a9cf324491dbc9e46f90cc04bf8/FLAGa12e2deb4 [2022-01-10 21:42:29,701 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:42:29,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c [2022-01-10 21:42:29,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700ba69bb/7ab88a9cf324491dbc9e46f90cc04bf8/FLAGa12e2deb4 [2022-01-10 21:42:29,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700ba69bb/7ab88a9cf324491dbc9e46f90cc04bf8 [2022-01-10 21:42:29,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:42:29,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:42:29,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:29,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:42:29,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:42:29,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:29" (1/1) ... [2022-01-10 21:42:29,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b4415b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:29, skipping insertion in model container [2022-01-10 21:42:29,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:29" (1/1) ... [2022-01-10 21:42:29,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:42:29,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:42:30,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c[44376,44389] [2022-01-10 21:42:30,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:30,022 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:42:30,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c[44376,44389] [2022-01-10 21:42:30,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:30,101 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:42:30,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30 WrapperNode [2022-01-10 21:42:30,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:30,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:30,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:42:30,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:42:30,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,157 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 510 [2022-01-10 21:42:30,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:30,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:42:30,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:42:30,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:42:30,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:42:30,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:42:30,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:42:30,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:42:30,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:30,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:30,232 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-10 21:42:30,235 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-10 21:42:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:42:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:42:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:42:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:42:30,338 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:42:30,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:42:30,351 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:42:30,696 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 21:42:30,696 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 21:42:30,696 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:42:30,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:42:30,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:42:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:30 BoogieIcfgContainer [2022-01-10 21:42:30,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:42:30,705 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:42:30,706 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:42:30,707 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:42:30,709 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:30" (1/1) ... [2022-01-10 21:42:30,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:30 BasicIcfg [2022-01-10 21:42:30,896 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:42:30,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:42:30,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:42:30,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:42:30,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:42:29" (1/4) ... [2022-01-10 21:42:30,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343931cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:30, skipping insertion in model container [2022-01-10 21:42:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:30" (2/4) ... [2022-01-10 21:42:30,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343931cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:30, skipping insertion in model container [2022-01-10 21:42:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:30" (3/4) ... [2022-01-10 21:42:30,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343931cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:30, skipping insertion in model container [2022-01-10 21:42:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:30" (4/4) ... [2022-01-10 21:42:30,903 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.cTransformedIcfg [2022-01-10 21:42:30,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:42:30,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:42:30,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:42:30,947 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-10 21:42:30,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:42:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 0 states have call successors, (0), 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-10 21:42:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:42:30,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:30,967 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] [2022-01-10 21:42:30,968 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -324124464, now seen corresponding path program 1 times [2022-01-10 21:42:30,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:30,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805952683] [2022-01-10 21:42:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:30,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:31,200 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-10 21:42:31,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:31,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805952683] [2022-01-10 21:42:31,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805952683] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:31,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:31,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:31,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509356781] [2022-01-10 21:42:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:31,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:31,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:31,233 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 21:42:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:31,332 INFO L93 Difference]: Finished difference Result 419 states and 720 transitions. [2022-01-10 21:42:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 21:42:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:31,344 INFO L225 Difference]: With dead ends: 419 [2022-01-10 21:42:31,344 INFO L226 Difference]: Without dead ends: 255 [2022-01-10 21:42:31,348 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-10 21:42:31,351 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 202 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:31,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 452 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:31,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-10 21:42:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-01-10 21:42:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5275590551181102) internal successors, (388), 254 states have internal predecessors, (388), 0 states have call successors, (0), 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-10 21:42:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2022-01-10 21:42:31,399 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 388 transitions. Word has length 33 [2022-01-10 21:42:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:31,399 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 388 transitions. [2022-01-10 21:42:31,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 21:42:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 388 transitions. [2022-01-10 21:42:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:42:31,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:31,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:31,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:42:31,403 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2067370465, now seen corresponding path program 1 times [2022-01-10 21:42:31,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:31,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511176660] [2022-01-10 21:42:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:31,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:31,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511176660] [2022-01-10 21:42:31,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511176660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:31,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:31,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:31,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646847620] [2022-01-10 21:42:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:31,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:31,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:31,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:31,528 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-10 21:42:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:31,711 INFO L93 Difference]: Finished difference Result 409 states and 631 transitions. [2022-01-10 21:42:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-01-10 21:42:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:31,716 INFO L225 Difference]: With dead ends: 409 [2022-01-10 21:42:31,716 INFO L226 Difference]: Without dead ends: 284 [2022-01-10 21:42:31,722 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-10 21:42:31,724 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 13 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:31,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 328 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-01-10 21:42:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2022-01-10 21:42:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.5054545454545454) internal successors, (414), 275 states have internal predecessors, (414), 0 states have call successors, (0), 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-10 21:42:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 414 transitions. [2022-01-10 21:42:31,754 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 414 transitions. Word has length 49 [2022-01-10 21:42:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:31,755 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 414 transitions. [2022-01-10 21:42:31,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-10 21:42:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 414 transitions. [2022-01-10 21:42:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 21:42:31,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:31,763 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:31,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:42:31,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -819516208, now seen corresponding path program 1 times [2022-01-10 21:42:31,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012633432] [2022-01-10 21:42:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:31,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 21:42:31,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012633432] [2022-01-10 21:42:31,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012633432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:31,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:31,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:31,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034475748] [2022-01-10 21:42:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:31,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:31,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:31,855 INFO L87 Difference]: Start difference. First operand 276 states and 414 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 21:42:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:32,034 INFO L93 Difference]: Finished difference Result 654 states and 1008 transitions. [2022-01-10 21:42:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:32,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 21:42:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:32,037 INFO L225 Difference]: With dead ends: 654 [2022-01-10 21:42:32,037 INFO L226 Difference]: Without dead ends: 386 [2022-01-10 21:42:32,040 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-10 21:42:32,044 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 50 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:32,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 313 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:42:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-01-10 21:42:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2022-01-10 21:42:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.4341736694677871) internal successors, (512), 357 states have internal predecessors, (512), 0 states have call successors, (0), 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-10 21:42:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 512 transitions. [2022-01-10 21:42:32,070 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 512 transitions. Word has length 70 [2022-01-10 21:42:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:32,072 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 512 transitions. [2022-01-10 21:42:32,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 21:42:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 512 transitions. [2022-01-10 21:42:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 21:42:32,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:32,076 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:32,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:42:32,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -468716271, now seen corresponding path program 1 times [2022-01-10 21:42:32,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:32,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440597593] [2022-01-10 21:42:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:32,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 21:42:32,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:32,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440597593] [2022-01-10 21:42:32,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440597593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:32,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:32,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:32,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487189484] [2022-01-10 21:42:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:32,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:32,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:32,173 INFO L87 Difference]: Start difference. First operand 358 states and 512 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 21:42:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:32,302 INFO L93 Difference]: Finished difference Result 764 states and 1109 transitions. [2022-01-10 21:42:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 21:42:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:32,304 INFO L225 Difference]: With dead ends: 764 [2022-01-10 21:42:32,304 INFO L226 Difference]: Without dead ends: 414 [2022-01-10 21:42:32,305 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-10 21:42:32,310 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 15 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:32,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 329 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-01-10 21:42:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 404. [2022-01-10 21:42:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.4094292803970223) internal successors, (568), 403 states have internal predecessors, (568), 0 states have call successors, (0), 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-10 21:42:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 568 transitions. [2022-01-10 21:42:32,324 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 568 transitions. Word has length 70 [2022-01-10 21:42:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:32,326 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 568 transitions. [2022-01-10 21:42:32,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 21:42:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 568 transitions. [2022-01-10 21:42:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 21:42:32,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:32,329 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:32,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:42:32,330 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -259506920, now seen corresponding path program 1 times [2022-01-10 21:42:32,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:32,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226521960] [2022-01-10 21:42:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:32,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 21:42:32,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:32,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226521960] [2022-01-10 21:42:32,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226521960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:32,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:32,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:32,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171089808] [2022-01-10 21:42:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:32,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:32,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:32,435 INFO L87 Difference]: Start difference. First operand 404 states and 568 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:32,599 INFO L93 Difference]: Finished difference Result 996 states and 1421 transitions. [2022-01-10 21:42:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-10 21:42:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:32,602 INFO L225 Difference]: With dead ends: 996 [2022-01-10 21:42:32,602 INFO L226 Difference]: Without dead ends: 594 [2022-01-10 21:42:32,603 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-10 21:42:32,604 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 164 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:32,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 176 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-01-10 21:42:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 580. [2022-01-10 21:42:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4196891191709844) internal successors, (822), 579 states have internal predecessors, (822), 0 states have call successors, (0), 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-10 21:42:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 822 transitions. [2022-01-10 21:42:32,625 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 822 transitions. Word has length 83 [2022-01-10 21:42:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:32,625 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 822 transitions. [2022-01-10 21:42:32,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 822 transitions. [2022-01-10 21:42:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 21:42:32,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:32,631 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:32,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:42:32,632 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash -406461535, now seen corresponding path program 1 times [2022-01-10 21:42:32,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:32,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917942964] [2022-01-10 21:42:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:32,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 21:42:32,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:32,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917942964] [2022-01-10 21:42:32,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917942964] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:32,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:32,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:32,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886692663] [2022-01-10 21:42:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:32,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:32,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:32,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:32,723 INFO L87 Difference]: Start difference. First operand 580 states and 822 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:32,848 INFO L93 Difference]: Finished difference Result 1230 states and 1763 transitions. [2022-01-10 21:42:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-01-10 21:42:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:32,853 INFO L225 Difference]: With dead ends: 1230 [2022-01-10 21:42:32,853 INFO L226 Difference]: Without dead ends: 658 [2022-01-10 21:42:32,854 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-10 21:42:32,855 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 31 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:32,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 328 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-01-10 21:42:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 630. [2022-01-10 21:42:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.4022257551669317) internal successors, (882), 629 states have internal predecessors, (882), 0 states have call successors, (0), 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-10 21:42:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 882 transitions. [2022-01-10 21:42:32,869 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 882 transitions. Word has length 91 [2022-01-10 21:42:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:32,870 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 882 transitions. [2022-01-10 21:42:32,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 882 transitions. [2022-01-10 21:42:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 21:42:32,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:32,876 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:32,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:42:32,876 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1300843090, now seen corresponding path program 1 times [2022-01-10 21:42:32,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:32,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586945528] [2022-01-10 21:42:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:32,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 21:42:32,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586945528] [2022-01-10 21:42:32,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586945528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:32,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:32,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:32,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120753805] [2022-01-10 21:42:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:32,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:32,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:32,962 INFO L87 Difference]: Start difference. First operand 630 states and 882 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:32,990 INFO L93 Difference]: Finished difference Result 1860 states and 2596 transitions. [2022-01-10 21:42:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-10 21:42:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:32,995 INFO L225 Difference]: With dead ends: 1860 [2022-01-10 21:42:32,995 INFO L226 Difference]: Without dead ends: 1238 [2022-01-10 21:42:32,996 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-10 21:42:32,997 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 178 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:32,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-01-10 21:42:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 632. [2022-01-10 21:42:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4009508716323296) internal successors, (884), 631 states have internal predecessors, (884), 0 states have call successors, (0), 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-10 21:42:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 884 transitions. [2022-01-10 21:42:33,015 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 884 transitions. Word has length 117 [2022-01-10 21:42:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:33,016 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 884 transitions. [2022-01-10 21:42:33,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 884 transitions. [2022-01-10 21:42:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 21:42:33,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:33,018 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:33,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:42:33,018 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1968632207, now seen corresponding path program 1 times [2022-01-10 21:42:33,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:33,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108861462] [2022-01-10 21:42:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:33,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-10 21:42:33,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108861462] [2022-01-10 21:42:33,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108861462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:33,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:33,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:33,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736059732] [2022-01-10 21:42:33,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:33,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:33,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:33,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:33,099 INFO L87 Difference]: Start difference. First operand 632 states and 884 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:33,145 INFO L93 Difference]: Finished difference Result 1278 states and 1793 transitions. [2022-01-10 21:42:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-10 21:42:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:33,149 INFO L225 Difference]: With dead ends: 1278 [2022-01-10 21:42:33,149 INFO L226 Difference]: Without dead ends: 954 [2022-01-10 21:42:33,150 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-10 21:42:33,151 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 152 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 367 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-10 21:42:33,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 367 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-01-10 21:42:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2022-01-10 21:42:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 1.397691500524659) internal successors, (1332), 953 states have internal predecessors, (1332), 0 states have call successors, (0), 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-10 21:42:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1332 transitions. [2022-01-10 21:42:33,175 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1332 transitions. Word has length 117 [2022-01-10 21:42:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:33,176 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1332 transitions. [2022-01-10 21:42:33,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1332 transitions. [2022-01-10 21:42:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 21:42:33,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:33,178 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:33,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:42:33,178 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1317243000, now seen corresponding path program 1 times [2022-01-10 21:42:33,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:33,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8907671] [2022-01-10 21:42:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:33,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-01-10 21:42:33,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:33,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8907671] [2022-01-10 21:42:33,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8907671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:33,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:33,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:33,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494290321] [2022-01-10 21:42:33,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:33,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:33,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:33,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:33,264 INFO L87 Difference]: Start difference. First operand 954 states and 1332 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:33,337 INFO L93 Difference]: Finished difference Result 1924 states and 2690 transitions. [2022-01-10 21:42:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:33,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-10 21:42:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:33,341 INFO L225 Difference]: With dead ends: 1924 [2022-01-10 21:42:33,342 INFO L226 Difference]: Without dead ends: 1278 [2022-01-10 21:42:33,342 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-10 21:42:33,344 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 159 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:33,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 364 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-01-10 21:42:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1276. [2022-01-10 21:42:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.3992156862745098) internal successors, (1784), 1275 states have internal predecessors, (1784), 0 states have call successors, (0), 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-10 21:42:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1784 transitions. [2022-01-10 21:42:33,373 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1784 transitions. Word has length 119 [2022-01-10 21:42:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:33,374 INFO L470 AbstractCegarLoop]: Abstraction has 1276 states and 1784 transitions. [2022-01-10 21:42:33,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1784 transitions. [2022-01-10 21:42:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 21:42:33,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:33,376 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:33,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:42:33,376 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 28097178, now seen corresponding path program 1 times [2022-01-10 21:42:33,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:33,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195585377] [2022-01-10 21:42:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:33,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 21:42:33,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195585377] [2022-01-10 21:42:33,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195585377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:33,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:33,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:33,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122148203] [2022-01-10 21:42:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:33,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:33,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:33,442 INFO L87 Difference]: Start difference. First operand 1276 states and 1784 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:33,501 INFO L93 Difference]: Finished difference Result 1602 states and 2240 transitions. [2022-01-10 21:42:33,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-01-10 21:42:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:33,507 INFO L225 Difference]: With dead ends: 1602 [2022-01-10 21:42:33,507 INFO L226 Difference]: Without dead ends: 1600 [2022-01-10 21:42:33,507 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-10 21:42:33,508 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 166 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:33,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 362 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-01-10 21:42:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1598. [2022-01-10 21:42:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.400751408891672) internal successors, (2237), 1597 states have internal predecessors, (2237), 0 states have call successors, (0), 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-10 21:42:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2237 transitions. [2022-01-10 21:42:33,545 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2237 transitions. Word has length 120 [2022-01-10 21:42:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:33,545 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 2237 transitions. [2022-01-10 21:42:33,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2237 transitions. [2022-01-10 21:42:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-10 21:42:33,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:33,547 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:33,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:42:33,548 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1885639424, now seen corresponding path program 1 times [2022-01-10 21:42:33,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472626001] [2022-01-10 21:42:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:33,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 21:42:33,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:33,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472626001] [2022-01-10 21:42:33,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472626001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:33,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:33,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:33,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660480147] [2022-01-10 21:42:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:33,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:33,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:33,611 INFO L87 Difference]: Start difference. First operand 1598 states and 2237 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:33,753 INFO L93 Difference]: Finished difference Result 3370 states and 4769 transitions. [2022-01-10 21:42:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-01-10 21:42:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:33,759 INFO L225 Difference]: With dead ends: 3370 [2022-01-10 21:42:33,759 INFO L226 Difference]: Without dead ends: 1780 [2022-01-10 21:42:33,763 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-10 21:42:33,763 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:33,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 329 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2022-01-10 21:42:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1733. [2022-01-10 21:42:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.3839491916859123) internal successors, (2397), 1732 states have internal predecessors, (2397), 0 states have call successors, (0), 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-10 21:42:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2397 transitions. [2022-01-10 21:42:33,807 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2397 transitions. Word has length 126 [2022-01-10 21:42:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:33,808 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2397 transitions. [2022-01-10 21:42:33,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2397 transitions. [2022-01-10 21:42:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-10 21:42:33,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:33,811 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:33,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:42:33,811 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:33,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1955208392, now seen corresponding path program 1 times [2022-01-10 21:42:33,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457842478] [2022-01-10 21:42:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:33,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 21:42:33,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457842478] [2022-01-10 21:42:33,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457842478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:33,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:33,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:33,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147733734] [2022-01-10 21:42:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:33,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:33,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:33,858 INFO L87 Difference]: Start difference. First operand 1733 states and 2397 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:34,050 INFO L93 Difference]: Finished difference Result 3498 states and 4840 transitions. [2022-01-10 21:42:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:34,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-10 21:42:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:34,056 INFO L225 Difference]: With dead ends: 3498 [2022-01-10 21:42:34,056 INFO L226 Difference]: Without dead ends: 1768 [2022-01-10 21:42:34,058 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-10 21:42:34,059 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 168 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:34,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 170 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-01-10 21:42:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1748. [2022-01-10 21:42:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3777904979965656) internal successors, (2407), 1747 states have internal predecessors, (2407), 0 states have call successors, (0), 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-10 21:42:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2407 transitions. [2022-01-10 21:42:34,109 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2407 transitions. Word has length 130 [2022-01-10 21:42:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:34,109 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2407 transitions. [2022-01-10 21:42:34,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2407 transitions. [2022-01-10 21:42:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-01-10 21:42:34,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:34,112 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:34,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:42:34,113 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 942160006, now seen corresponding path program 1 times [2022-01-10 21:42:34,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:34,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561815022] [2022-01-10 21:42:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:34,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 21:42:34,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:34,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561815022] [2022-01-10 21:42:34,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561815022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:34,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:34,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:34,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926353496] [2022-01-10 21:42:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:34,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:34,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:34,193 INFO L87 Difference]: Start difference. First operand 1748 states and 2407 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:34,340 INFO L93 Difference]: Finished difference Result 3643 states and 5067 transitions. [2022-01-10 21:42:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:34,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-01-10 21:42:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:34,348 INFO L225 Difference]: With dead ends: 3643 [2022-01-10 21:42:34,348 INFO L226 Difference]: Without dead ends: 1903 [2022-01-10 21:42:34,351 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-10 21:42:34,351 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:34,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 328 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-01-10 21:42:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1893. [2022-01-10 21:42:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.3620507399577166) internal successors, (2577), 1892 states have internal predecessors, (2577), 0 states have call successors, (0), 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-10 21:42:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2577 transitions. [2022-01-10 21:42:34,402 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2577 transitions. Word has length 149 [2022-01-10 21:42:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:34,402 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2577 transitions. [2022-01-10 21:42:34,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2577 transitions. [2022-01-10 21:42:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-10 21:42:34,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:34,405 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:34,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:42:34,405 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:34,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2064227550, now seen corresponding path program 1 times [2022-01-10 21:42:34,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:34,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201361665] [2022-01-10 21:42:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:34,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 21:42:34,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201361665] [2022-01-10 21:42:34,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201361665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:34,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:34,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:34,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678739830] [2022-01-10 21:42:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:34,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:34,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:34,463 INFO L87 Difference]: Start difference. First operand 1893 states and 2577 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:34,628 INFO L93 Difference]: Finished difference Result 3933 states and 5417 transitions. [2022-01-10 21:42:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:34,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-10 21:42:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:34,635 INFO L225 Difference]: With dead ends: 3933 [2022-01-10 21:42:34,636 INFO L226 Difference]: Without dead ends: 2048 [2022-01-10 21:42:34,637 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-10 21:42:34,638 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 15 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:34,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 310 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-01-10 21:42:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-01-10 21:42:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 2047 states have (on average 1.3468490473864192) internal successors, (2757), 2047 states have internal predecessors, (2757), 0 states have call successors, (0), 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-10 21:42:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2757 transitions. [2022-01-10 21:42:34,695 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2757 transitions. Word has length 155 [2022-01-10 21:42:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:34,695 INFO L470 AbstractCegarLoop]: Abstraction has 2048 states and 2757 transitions. [2022-01-10 21:42:34,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2757 transitions. [2022-01-10 21:42:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 21:42:34,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:34,699 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:34,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:42:34,700 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash -26885253, now seen corresponding path program 1 times [2022-01-10 21:42:34,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456991528] [2022-01-10 21:42:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:34,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 21:42:34,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:34,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456991528] [2022-01-10 21:42:34,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456991528] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:34,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747199599] [2022-01-10 21:42:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:34,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:34,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 21:42:34,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 21:42:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:35,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 21:42:35,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-01-10 21:42:35,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:42:35,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747199599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:35,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:42:35,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 21:42:35,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542647555] [2022-01-10 21:42:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:35,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:35,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:35,355 INFO L87 Difference]: Start difference. First operand 2048 states and 2757 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-10 21:42:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:35,431 INFO L93 Difference]: Finished difference Result 4112 states and 5538 transitions. [2022-01-10 21:42:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 183 [2022-01-10 21:42:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:35,439 INFO L225 Difference]: With dead ends: 4112 [2022-01-10 21:42:35,439 INFO L226 Difference]: Without dead ends: 2462 [2022-01-10 21:42:35,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:35,444 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 131 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:35,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 562 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2022-01-10 21:42:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2460. [2022-01-10 21:42:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 1.3387555917039446) internal successors, (3292), 2459 states have internal predecessors, (3292), 0 states have call successors, (0), 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-10 21:42:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3292 transitions. [2022-01-10 21:42:35,514 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3292 transitions. Word has length 183 [2022-01-10 21:42:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:35,515 INFO L470 AbstractCegarLoop]: Abstraction has 2460 states and 3292 transitions. [2022-01-10 21:42:35,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-10 21:42:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3292 transitions. [2022-01-10 21:42:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-10 21:42:35,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:35,521 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:35,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 21:42:35,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 21:42:35,735 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash -600440041, now seen corresponding path program 1 times [2022-01-10 21:42:35,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472352986] [2022-01-10 21:42:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:35,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 21:42:35,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472352986] [2022-01-10 21:42:35,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472352986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:35,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:35,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:35,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704095871] [2022-01-10 21:42:35,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:35,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:35,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:35,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:35,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:35,788 INFO L87 Difference]: Start difference. First operand 2460 states and 3292 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-10 21:42:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:35,878 INFO L93 Difference]: Finished difference Result 4573 states and 6112 transitions. [2022-01-10 21:42:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 187 [2022-01-10 21:42:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:35,887 INFO L225 Difference]: With dead ends: 4573 [2022-01-10 21:42:35,887 INFO L226 Difference]: Without dead ends: 2511 [2022-01-10 21:42:35,890 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-10 21:42:35,891 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 17 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:35,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 444 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-01-10 21:42:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2022-01-10 21:42:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 1.3346613545816732) internal successors, (3350), 2510 states have internal predecessors, (3350), 0 states have call successors, (0), 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-10 21:42:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3350 transitions. [2022-01-10 21:42:35,955 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3350 transitions. Word has length 187 [2022-01-10 21:42:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:35,955 INFO L470 AbstractCegarLoop]: Abstraction has 2511 states and 3350 transitions. [2022-01-10 21:42:35,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-10 21:42:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3350 transitions. [2022-01-10 21:42:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-10 21:42:35,959 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:35,960 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:35,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:42:35,960 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1070073528, now seen corresponding path program 1 times [2022-01-10 21:42:35,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:35,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407319927] [2022-01-10 21:42:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:35,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-10 21:42:36,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:36,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407319927] [2022-01-10 21:42:36,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407319927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:36,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:36,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:36,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370075774] [2022-01-10 21:42:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:36,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:36,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:36,013 INFO L87 Difference]: Start difference. First operand 2511 states and 3350 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:36,087 INFO L93 Difference]: Finished difference Result 3749 states and 5008 transitions. [2022-01-10 21:42:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:36,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2022-01-10 21:42:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:36,096 INFO L225 Difference]: With dead ends: 3749 [2022-01-10 21:42:36,097 INFO L226 Difference]: Without dead ends: 2923 [2022-01-10 21:42:36,098 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-10 21:42:36,099 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 153 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 365 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-10 21:42:36,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 365 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2022-01-10 21:42:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2923. [2022-01-10 21:42:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2922 states have (on average 1.3360711841204653) internal successors, (3904), 2922 states have internal predecessors, (3904), 0 states have call successors, (0), 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-10 21:42:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3904 transitions. [2022-01-10 21:42:36,171 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3904 transitions. Word has length 187 [2022-01-10 21:42:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:36,172 INFO L470 AbstractCegarLoop]: Abstraction has 2923 states and 3904 transitions. [2022-01-10 21:42:36,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3904 transitions. [2022-01-10 21:42:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-01-10 21:42:36,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:36,179 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:36,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:42:36,179 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2111983772, now seen corresponding path program 1 times [2022-01-10 21:42:36,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437856783] [2022-01-10 21:42:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:36,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-01-10 21:42:36,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:36,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437856783] [2022-01-10 21:42:36,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437856783] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:36,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606145000] [2022-01-10 21:42:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:36,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:36,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:36,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 21:42:36,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 21:42:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:36,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:36,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-01-10 21:42:37,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:42:37,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606145000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:37,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:42:37,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 21:42:37,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301255424] [2022-01-10 21:42:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:37,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:37,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:37,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:37,366 INFO L87 Difference]: Start difference. First operand 2923 states and 3904 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-10 21:42:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:37,480 INFO L93 Difference]: Finished difference Result 8564 states and 11464 transitions. [2022-01-10 21:42:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 289 [2022-01-10 21:42:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:37,512 INFO L225 Difference]: With dead ends: 8564 [2022-01-10 21:42:37,512 INFO L226 Difference]: Without dead ends: 5649 [2022-01-10 21:42:37,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:37,518 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 114 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:37,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2022-01-10 21:42:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5647. [2022-01-10 21:42:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5646 states have (on average 1.3372298972724053) internal successors, (7550), 5646 states have internal predecessors, (7550), 0 states have call successors, (0), 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-10 21:42:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 7550 transitions. [2022-01-10 21:42:37,703 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 7550 transitions. Word has length 289 [2022-01-10 21:42:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:37,704 INFO L470 AbstractCegarLoop]: Abstraction has 5647 states and 7550 transitions. [2022-01-10 21:42:37,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-10 21:42:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 7550 transitions. [2022-01-10 21:42:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-01-10 21:42:37,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:37,715 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:37,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 21:42:37,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 21:42:37,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1831633883, now seen corresponding path program 1 times [2022-01-10 21:42:37,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:37,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468029713] [2022-01-10 21:42:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:37,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-01-10 21:42:38,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468029713] [2022-01-10 21:42:38,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468029713] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:38,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113588554] [2022-01-10 21:42:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:38,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:38,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 21:42:38,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 21:42:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:38,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:38,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-01-10 21:42:38,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-01-10 21:42:38,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113588554] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:38,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:38,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:38,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373090900] [2022-01-10 21:42:38,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:38,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:38,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:38,991 INFO L87 Difference]: Start difference. First operand 5647 states and 7550 transitions. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 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-10 21:42:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:39,734 INFO L93 Difference]: Finished difference Result 17515 states and 23541 transitions. [2022-01-10 21:42:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 21:42:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 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 289 [2022-01-10 21:42:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:39,759 INFO L225 Difference]: With dead ends: 17515 [2022-01-10 21:42:39,759 INFO L226 Difference]: Without dead ends: 11496 [2022-01-10 21:42:39,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:42:39,771 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 730 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:39,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 692 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:42:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11496 states. [2022-01-10 21:42:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11496 to 6407. [2022-01-10 21:42:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6407 states, 6406 states have (on average 1.3448329690914766) internal successors, (8615), 6406 states have internal predecessors, (8615), 0 states have call successors, (0), 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-10 21:42:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 8615 transitions. [2022-01-10 21:42:40,021 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 8615 transitions. Word has length 289 [2022-01-10 21:42:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:40,021 INFO L470 AbstractCegarLoop]: Abstraction has 6407 states and 8615 transitions. [2022-01-10 21:42:40,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 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-10 21:42:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 8615 transitions. [2022-01-10 21:42:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2022-01-10 21:42:40,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:40,034 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:40,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 21:42:40,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:40,256 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 660323381, now seen corresponding path program 1 times [2022-01-10 21:42:40,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949135302] [2022-01-10 21:42:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:40,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-01-10 21:42:40,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:40,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949135302] [2022-01-10 21:42:40,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949135302] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:40,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824466159] [2022-01-10 21:42:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:40,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:40,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 21:42:40,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 21:42:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:40,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:40,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-01-10 21:42:41,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-01-10 21:42:41,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824466159] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:41,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:41,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:41,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215171690] [2022-01-10 21:42:41,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:41,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:41,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:41,454 INFO L87 Difference]: Start difference. First operand 6407 states and 8615 transitions. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 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-10 21:42:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:42,347 INFO L93 Difference]: Finished difference Result 23480 states and 31730 transitions. [2022-01-10 21:42:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 21:42:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 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 319 [2022-01-10 21:42:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:42,384 INFO L225 Difference]: With dead ends: 23480 [2022-01-10 21:42:42,384 INFO L226 Difference]: Without dead ends: 17081 [2022-01-10 21:42:42,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:42:42,397 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 491 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:42,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1597 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 21:42:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2022-01-10 21:42:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 9643. [2022-01-10 21:42:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9643 states, 9642 states have (on average 1.3187098112424809) internal successors, (12715), 9642 states have internal predecessors, (12715), 0 states have call successors, (0), 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-10 21:42:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9643 states to 9643 states and 12715 transitions. [2022-01-10 21:42:42,733 INFO L78 Accepts]: Start accepts. Automaton has 9643 states and 12715 transitions. Word has length 319 [2022-01-10 21:42:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:42,734 INFO L470 AbstractCegarLoop]: Abstraction has 9643 states and 12715 transitions. [2022-01-10 21:42:42,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 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-10 21:42:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 9643 states and 12715 transitions. [2022-01-10 21:42:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-01-10 21:42:42,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:42,750 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:42,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 21:42:42,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:42,960 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1134655962, now seen corresponding path program 1 times [2022-01-10 21:42:42,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:42,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573081665] [2022-01-10 21:42:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:42,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 771 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-01-10 21:42:43,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573081665] [2022-01-10 21:42:43,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573081665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:43,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:43,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:43,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404384692] [2022-01-10 21:42:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:43,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:43,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:43,027 INFO L87 Difference]: Start difference. First operand 9643 states and 12715 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 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-10 21:42:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:43,280 INFO L93 Difference]: Finished difference Result 15514 states and 20657 transitions. [2022-01-10 21:42:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:43,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 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 357 [2022-01-10 21:42:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:43,291 INFO L225 Difference]: With dead ends: 15514 [2022-01-10 21:42:43,291 INFO L226 Difference]: Without dead ends: 5216 [2022-01-10 21:42:43,302 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-10 21:42:43,303 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 20 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:43,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 329 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2022-01-10 21:42:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 4946. [2022-01-10 21:42:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4946 states, 4945 states have (on average 1.3094034378159758) internal successors, (6475), 4945 states have internal predecessors, (6475), 0 states have call successors, (0), 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-10 21:42:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4946 states to 4946 states and 6475 transitions. [2022-01-10 21:42:43,445 INFO L78 Accepts]: Start accepts. Automaton has 4946 states and 6475 transitions. Word has length 357 [2022-01-10 21:42:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:43,445 INFO L470 AbstractCegarLoop]: Abstraction has 4946 states and 6475 transitions. [2022-01-10 21:42:43,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 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-10 21:42:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4946 states and 6475 transitions. [2022-01-10 21:42:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2022-01-10 21:42:43,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:43,457 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:43,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 21:42:43,458 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash -730387192, now seen corresponding path program 1 times [2022-01-10 21:42:43,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:43,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918333390] [2022-01-10 21:42:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:43,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-01-10 21:42:43,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918333390] [2022-01-10 21:42:43,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918333390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:43,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:43,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:43,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886868559] [2022-01-10 21:42:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:43,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:43,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:43,542 INFO L87 Difference]: Start difference. First operand 4946 states and 6475 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-10 21:42:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:43,746 INFO L93 Difference]: Finished difference Result 10496 states and 13839 transitions. [2022-01-10 21:42:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:43,747 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 358 [2022-01-10 21:42:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:43,757 INFO L225 Difference]: With dead ends: 10496 [2022-01-10 21:42:43,757 INFO L226 Difference]: Without dead ends: 5558 [2022-01-10 21:42:43,763 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-10 21:42:43,767 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:43,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 325 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2022-01-10 21:42:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5524. [2022-01-10 21:42:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2924135433641137) internal successors, (7138), 5523 states have internal predecessors, (7138), 0 states have call successors, (0), 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-10 21:42:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7138 transitions. [2022-01-10 21:42:43,935 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7138 transitions. Word has length 358 [2022-01-10 21:42:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:43,936 INFO L470 AbstractCegarLoop]: Abstraction has 5524 states and 7138 transitions. [2022-01-10 21:42:43,936 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-10 21:42:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7138 transitions. [2022-01-10 21:42:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2022-01-10 21:42:43,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:43,949 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:43,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 21:42:43,950 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -755097932, now seen corresponding path program 1 times [2022-01-10 21:42:43,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:43,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394855978] [2022-01-10 21:42:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:43,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2022-01-10 21:42:44,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:44,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394855978] [2022-01-10 21:42:44,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394855978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:44,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:44,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:44,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174286164] [2022-01-10 21:42:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:44,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:44,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:44,028 INFO L87 Difference]: Start difference. First operand 5524 states and 7138 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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-10 21:42:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:44,234 INFO L93 Difference]: Finished difference Result 11035 states and 14252 transitions. [2022-01-10 21:42:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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 389 [2022-01-10 21:42:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:44,244 INFO L225 Difference]: With dead ends: 11035 [2022-01-10 21:42:44,244 INFO L226 Difference]: Without dead ends: 5519 [2022-01-10 21:42:44,250 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-10 21:42:44,251 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:44,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 325 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2022-01-10 21:42:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 4797. [2022-01-10 21:42:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4797 states, 4796 states have (on average 1.2668890742285237) internal successors, (6076), 4796 states have internal predecessors, (6076), 0 states have call successors, (0), 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-10 21:42:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4797 states to 4797 states and 6076 transitions. [2022-01-10 21:42:44,373 INFO L78 Accepts]: Start accepts. Automaton has 4797 states and 6076 transitions. Word has length 389 [2022-01-10 21:42:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:44,373 INFO L470 AbstractCegarLoop]: Abstraction has 4797 states and 6076 transitions. [2022-01-10 21:42:44,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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-10 21:42:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4797 states and 6076 transitions. [2022-01-10 21:42:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2022-01-10 21:42:44,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:44,410 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:44,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 21:42:44,411 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1079640572, now seen corresponding path program 1 times [2022-01-10 21:42:44,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:44,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919000611] [2022-01-10 21:42:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:44,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 21:42:44,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919000611] [2022-01-10 21:42:44,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919000611] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16362833] [2022-01-10 21:42:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:44,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:44,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 21:42:44,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 21:42:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:44,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:44,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 21:42:45,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 21:42:45,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16362833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:45,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:45,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:45,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929751891] [2022-01-10 21:42:45,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:45,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:45,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:45,745 INFO L87 Difference]: Start difference. First operand 4797 states and 6076 transitions. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 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-10 21:42:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:46,202 INFO L93 Difference]: Finished difference Result 9608 states and 12176 transitions. [2022-01-10 21:42:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:42:46,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 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 422 [2022-01-10 21:42:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:46,203 INFO L225 Difference]: With dead ends: 9608 [2022-01-10 21:42:46,204 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:42:46,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:42:46,212 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 258 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:46,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 986 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:42:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:42:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:42:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10 21:42:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:42:46,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 422 [2022-01-10 21:42:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:46,214 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:42:46,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 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-10 21:42:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:42:46,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:42:46,216 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:42:46,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 21:42:46,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-10 21:42:46,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:43:02,981 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 637) no Hoare annotation was computed. [2022-01-10 21:43:02,982 INFO L861 garLoopResultBuilder]: At program point L636(lines 22 638) the Hoare annotation is: true [2022-01-10 21:43:02,983 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 625) the Hoare annotation is: (let ((.cse13 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse15 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse10 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse14 (= 8608 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse3 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse6 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse17 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse2 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse22 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (.cse5 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (.cse9 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse21 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse8 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse19 (= 8592 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse23 (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse5 .cse1 .cse7 .cse8 .cse9) (and .cse10 .cse4 .cse11 .cse0 .cse1 .cse12) (and .cse11 .cse0 .cse1 .cse13) (and .cse11 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse14 .cse4 .cse0 .cse5 .cse1 .cse7) (and .cse15 .cse4 .cse0 .cse5 .cse1 .cse7) (and .cse0 .cse5 .cse1 .cse7 .cse13) (and .cse16 .cse17 .cse18 .cse8) (and .cse4 .cse19 .cse0 .cse5 .cse1 .cse7) (and .cse20 .cse11 .cse21) (and .cse4 .cse0 .cse1 .cse18) (and .cse16 .cse3 .cse4 .cse0 .cse6 .cse1) (and .cse11 .cse0 .cse1 .cse9) (and .cse0 .cse5 .cse1 .cse7 .cse8 .cse22) (and .cse23 .cse0 .cse5 .cse1 .cse7) (and .cse15 .cse11 .cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8544) .cse1) (and .cse10 .cse4 .cse0 .cse5 .cse1 .cse7 .cse12) (and .cse14 .cse4 .cse11 .cse0 .cse1) (and .cse16 .cse3 .cse17 .cse6 .cse8) (and .cse16 .cse17 .cse8 .cse2) (and .cse11 .cse0 .cse1 .cse22) (and .cse20 .cse21 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 .cse5 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse9) (and .cse20 .cse0 .cse21 .cse1 .cse8) (and .cse4 .cse19 .cse11 .cse0 .cse1) (and .cse23 .cse11 .cse0 .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-10 21:43:02,983 INFO L861 garLoopResultBuilder]: At program point L648(lines 639 650) the Hoare annotation is: true [2022-01-10 21:43:02,983 INFO L861 garLoopResultBuilder]: At program point L626(lines 109 627) the Hoare annotation is: true [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 606) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point L631-2(lines 631 633) no Hoare annotation was computed. [2022-01-10 21:43:02,983 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 606) the Hoare annotation is: (and (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-10 21:43:02,983 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 605) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 605) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse2 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8544)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 .cse2 .cse3) (and (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse4) (and .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)))) [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 604) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 603) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 602) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 601) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 601) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 .cse1 .cse2 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse2 .cse3))) [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 600) no Hoare annotation was computed. [2022-01-10 21:43:02,984 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 599) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L854 garLoopResultBuilder]: At program point L570(lines 110 625) the Hoare annotation is: (let ((.cse13 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse15 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse10 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse14 (= 8608 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse3 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse6 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse17 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse2 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse22 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (.cse5 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (.cse9 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse21 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse8 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse19 (= 8592 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse23 (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse5 .cse1 .cse7 .cse8 .cse9) (and .cse10 .cse4 .cse11 .cse0 .cse1 .cse12) (and .cse11 .cse0 .cse1 .cse13) (and .cse11 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse14 .cse4 .cse0 .cse5 .cse1 .cse7) (and .cse15 .cse4 .cse0 .cse5 .cse1 .cse7) (and .cse0 .cse5 .cse1 .cse7 .cse13) (and .cse16 .cse17 .cse18 .cse8) (and .cse4 .cse19 .cse0 .cse5 .cse1 .cse7) (and .cse20 .cse11 .cse21) (and .cse4 .cse0 .cse1 .cse18) (and .cse16 .cse3 .cse4 .cse0 .cse6 .cse1) (and .cse11 .cse0 .cse1 .cse9) (and .cse0 .cse5 .cse1 .cse7 .cse8 .cse22) (and .cse23 .cse0 .cse5 .cse1 .cse7) (and .cse15 .cse11 .cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8544) .cse1) (and .cse10 .cse4 .cse0 .cse5 .cse1 .cse7 .cse12) (and .cse14 .cse4 .cse11 .cse0 .cse1) (and .cse16 .cse3 .cse17 .cse6 .cse8) (and .cse16 .cse17 .cse8 .cse2) (and .cse11 .cse0 .cse1 .cse22) (and .cse20 .cse21 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 .cse5 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse9) (and .cse20 .cse0 .cse21 .cse1 .cse8) (and .cse4 .cse19 .cse11 .cse0 .cse1) (and .cse23 .cse11 .cse0 .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-10 21:43:02,985 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 599) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse0) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 598) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-10 21:43:02,985 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 622) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 623) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 598) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 .cse1 .cse2 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse2 .cse3))) [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 597) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L609(lines 609 614) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 596) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L611(lines 611 613) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L609-2(lines 608 622) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 595) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L858 garLoopResultBuilder]: For program point L616(lines 616 620) no Hoare annotation was computed. [2022-01-10 21:43:02,986 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 595) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)))) [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 594) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 593) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 593) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse3 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 .cse2 .cse3) (and .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656) .cse3))) [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 592) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 325) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 591) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 325) no Hoare annotation was computed. [2022-01-10 21:43:02,987 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 591) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse3 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6)) (and .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 .cse4 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656) .cse3))) [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 590) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 317 325) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 589) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 589) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse2 .cse3) (and .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 588) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L854 garLoopResultBuilder]: At program point L365(lines 341 386) the Hoare annotation is: (let ((.cse0 (not (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse3 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6)) (and .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 .cse4 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656) .cse3))) [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 385) no Hoare annotation was computed. [2022-01-10 21:43:02,988 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 428) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 587) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 384) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L854 garLoopResultBuilder]: At program point L402(lines 393 428) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse2 .cse3) (and .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,989 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 587) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse2 .cse3) (and .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 586) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L367-2(lines 364 373) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 381) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L347-1(lines 347 384) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 426) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L438(lines 438 440) no Hoare annotation was computed. [2022-01-10 21:43:02,989 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 585) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 379) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 426) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse2 .cse3) (and .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,990 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 585) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1 .cse2) (and .cse3 .cse0 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse2) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 .cse1 .cse2) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse2) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4) (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656) .cse2))) [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 584) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 419) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 452) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 454) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 584) the Hoare annotation is: (let ((.cse2 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse1 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse4 .cse5 .cse1) (and .cse2 .cse0 .cse3 .cse4 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7) .cse1))) [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 583) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L858 garLoopResultBuilder]: For program point L356-2(lines 356 360) no Hoare annotation was computed. [2022-01-10 21:43:02,990 INFO L854 garLoopResultBuilder]: At program point L496(lines 83 637) the Hoare annotation is: false [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 422) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 462) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 582) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 375) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 635) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L463(lines 463 472) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 582) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse3 .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 581) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-10 21:43:02,991 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 580) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 580) the Hoare annotation is: (let ((.cse0 (= 8608 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 .cse1 .cse2 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse2 .cse3) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 579) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 578) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 578) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse3 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= 6 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 7)) (and .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse3 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656)))) [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 577) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 497) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 576) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L498(lines 498 500) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 576) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse1 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656)))) [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 575) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 505) no Hoare annotation was computed. [2022-01-10 21:43:02,992 INFO L858 garLoopResultBuilder]: For program point L511(lines 511 514) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 574) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 505) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 526) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 574) the Hoare annotation is: (let ((.cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8656)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 573) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L522-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L519(lines 519 525) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 542) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 572) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 535) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 524) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 21:43:02,993 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 572) the Hoare annotation is: true [2022-01-10 21:43:02,994 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 572) the Hoare annotation is: true [2022-01-10 21:43:02,994 INFO L858 garLoopResultBuilder]: For program point L547(lines 547 551) no Hoare annotation was computed. [2022-01-10 21:43:02,994 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 563) no Hoare annotation was computed. [2022-01-10 21:43:02,994 INFO L858 garLoopResultBuilder]: For program point L547-2(lines 547 551) no Hoare annotation was computed. [2022-01-10 21:43:02,994 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-01-10 21:43:02,994 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 557 563) no Hoare annotation was computed. [2022-01-10 21:43:02,997 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 21:43:02,998 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:43:03,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:43:03 BasicIcfg [2022-01-10 21:43:03,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:43:03,046 INFO L158 Benchmark]: Toolchain (without parser) took 33310.84ms. Allocated memory was 187.7MB in the beginning and 584.1MB in the end (delta: 396.4MB). Free memory was 131.3MB in the beginning and 304.1MB in the end (delta: -172.8MB). Peak memory consumption was 347.7MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,047 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:43:03,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.47ms. Allocated memory was 187.7MB in the beginning and 280.0MB in the end (delta: 92.3MB). Free memory was 131.0MB in the beginning and 246.3MB in the end (delta: -115.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 280.0MB. Free memory was 246.3MB in the beginning and 243.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,047 INFO L158 Benchmark]: Boogie Preprocessor took 41.80ms. Allocated memory is still 280.0MB. Free memory was 243.7MB in the beginning and 241.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,048 INFO L158 Benchmark]: RCFGBuilder took 503.99ms. Allocated memory is still 280.0MB. Free memory was 241.6MB in the beginning and 212.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,048 INFO L158 Benchmark]: IcfgTransformer took 191.18ms. Allocated memory is still 280.0MB. Free memory was 212.7MB in the beginning and 198.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,048 INFO L158 Benchmark]: TraceAbstraction took 32147.97ms. Allocated memory was 280.0MB in the beginning and 584.1MB in the end (delta: 304.1MB). Free memory was 197.5MB in the beginning and 304.1MB in the end (delta: -106.6MB). Peak memory consumption was 322.5MB. Max. memory is 8.0GB. [2022-01-10 21:43:03,049 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 362.47ms. Allocated memory was 187.7MB in the beginning and 280.0MB in the end (delta: 92.3MB). Free memory was 131.0MB in the beginning and 246.3MB in the end (delta: -115.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 280.0MB. Free memory was 246.3MB in the beginning and 243.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.80ms. Allocated memory is still 280.0MB. Free memory was 243.7MB in the beginning and 241.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 503.99ms. Allocated memory is still 280.0MB. Free memory was 241.6MB in the beginning and 212.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * IcfgTransformer took 191.18ms. Allocated memory is still 280.0MB. Free memory was 212.7MB in the beginning and 198.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32147.97ms. Allocated memory was 280.0MB in the beginning and 584.1MB in the end (delta: 304.1MB). Free memory was 197.5MB in the beginning and 304.1MB in the end (delta: -106.6MB). Peak memory consumption was 322.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 635]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 24, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3278 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3278 mSDsluCounter, 10948 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4980 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3633 IncrementalHoareTripleChecker+Invalid, 4204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 5968 mSDtfsCounter, 3633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2623 GetRequests, 2575 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9643occurred in iteration=20, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 14332 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 530 NumberOfFragments, 1853 HoareAnnotationTreeSize, 28 FomulaSimplifications, 54222 FormulaSimplificationTreeSizeReduction, 7.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 68697 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5911 NumberOfCodeBlocks, 5911 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6909 ConstructedInterpolants, 0 QuantifiedInterpolants, 11108 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5865 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 19616/19860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit))) || ((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32)) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(8656bv32, s__state)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && ~bvult64(s__state, 8656bv32)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((((~bvule32(blastFlag, 4bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ~bvule32(blastFlag, 0bv32)) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(s__state, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(s__hit, 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state)) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((((!~bvule32(8544bv32, s__state) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && 8448bv32 == s__state) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || (((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((((~bvule32(s__state, 8576bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && 8592bv32 == s__state) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(8656bv32, s__state)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8672bv32))) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8592bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((((!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__s3__tmp__next_state___0, 8544bv32))) || ((((~bvule32(blastFlag, 6bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (((((!~bvule32(8544bv32, s__state) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((((~bvule32(blastFlag, 4bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ~bvule32(blastFlag, 0bv32)) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(s__state, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(s__hit, 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state)) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && 8608bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((((!~bvule32(8544bv32, s__state) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && 8448bv32 == s__state) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || (((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((((~bvule32(s__state, 8576bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && 8592bv32 == s__state) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(8656bv32, s__state)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8672bv32))) || ((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8592bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((((!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__s3__tmp__next_state___0, 8544bv32))) || ((((~bvule32(blastFlag, 6bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state)) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8544bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8544bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8544bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ~bvule32(blastFlag, 0bv32) && ~bvule32(8656bv32, s__state) - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: ((((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || ((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32))) || (((((~bvule32(blastFlag, 6bv32) && !~bvule32(8544bv32, s__state)) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(0bv32, s__hit))) || ((((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit))) || ((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state)) || (((~bvule32(s__hit, 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state)) || (((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && 8448bv32 == s__state) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && ~bvult64(s__state, 8656bv32))) || (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit))) || ((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((~bvule32(s__hit, 0bv32) && ~bvule32(8656bv32, s__state)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) || (~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state))) || (blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (((((!~bvule32(8544bv32, s__state) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || ((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32))) || ((((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || (((((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit))) || ((~bvule32(s__state, 8576bv32) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((!~bvule32(s__state, 8496bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvult64(s__state, 8656bv32)) || (((((((!~bvule32(s__state, 8496bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((((!~bvule32(s__state, 8496bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((!~bvule32(8544bv32, s__state) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (!~bvule32(8544bv32, s__state) && ~bvule32(blastFlag, 2bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((~bvule32(blastFlag, 4bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((((~bvule32(blastFlag, 4bv32) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || ((((((~bvule32(s__hit, 0bv32) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) || ((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(blastFlag, 0bv32))) || (((((~bvule32(blastFlag, 6bv32) && !~bvule32(8544bv32, s__state)) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(0bv32, s__hit))) || ((((((!~bvule32(8544bv32, s__state) && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(6bv32, blastFlag)) && ~bvule32(blastFlag, 7bv32)) && ~bvult64(s__s3__tmp__next_state___0, 8656bv32)) && ~bvule32(0bv32, s__hit)) RESULT: Ultimate proved your program to be correct! [2022-01-10 21:43:03,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...