/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_SUM.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:55:02,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:55:02,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:55:03,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:55:03,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:55:03,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:55:03,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:55:03,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:55:03,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:55:03,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:55:03,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:55:03,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:55:03,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:55:03,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:55:03,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:55:03,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:55:03,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:55:03,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:55:03,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:55:03,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:55:03,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:55:03,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:55:03,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:55:03,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:55:03,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:55:03,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:55:03,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:55:03,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:55:03,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:55:03,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:55:03,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:55:03,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:55:03,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:55:03,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:55:03,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:55:03,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:55:03,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:55:03,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:55:03,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:55:03,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:55:03,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:55:03,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 01:55:03,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:55:03,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:55:03,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:55:03,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:55:03,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:55:03,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:55:03,093 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:55:03,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:55:03,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:55:03,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:55:03,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:55:03,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:55:03,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:55:03,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:55:03,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:55:03,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:55:03,098 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:55:03,098 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:55:03,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:55:03,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:55:03,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:55:03,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:55:03,342 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:55:03,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2022-01-11 01:55:03,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19043b7dc/51eb40dc88f24dc281d24cfb79aa20a7/FLAG30add23d6 [2022-01-11 01:55:03,879 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:55:03,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2022-01-11 01:55:03,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19043b7dc/51eb40dc88f24dc281d24cfb79aa20a7/FLAG30add23d6 [2022-01-11 01:55:04,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19043b7dc/51eb40dc88f24dc281d24cfb79aa20a7 [2022-01-11 01:55:04,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:55:04,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:55:04,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:55:04,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:55:04,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:55:04,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1227b985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04, skipping insertion in model container [2022-01-11 01:55:04,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:55:04,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:55:04,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2022-01-11 01:55:04,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:55:04,573 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:55:04,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2022-01-11 01:55:04,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:55:04,627 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:55:04,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04 WrapperNode [2022-01-11 01:55:04,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:55:04,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:55:04,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:55:04,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:55:04,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,657 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 486 [2022-01-11 01:55:04,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:55:04,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:55:04,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:55:04,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:55:04,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:55:04,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:55:04,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:55:04,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:55:04,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (1/1) ... [2022-01-11 01:55:04,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:55:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:04,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:55:04,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:55:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:55:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:55:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:55:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:55:04,833 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:55:04,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:55:04,845 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 01:55:05,380 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-11 01:55:05,381 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-11 01:55:05,381 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:55:05,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:55:05,392 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 01:55:05,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:05 BoogieIcfgContainer [2022-01-11 01:55:05,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:55:05,394 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:55:05,394 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:55:05,397 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:55:05,400 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:05" (1/1) ... [2022-01-11 01:55:05,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:55:05 BasicIcfg [2022-01-11 01:55:05,591 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:55:05,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:55:05,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:55:05,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:55:05,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:55:04" (1/4) ... [2022-01-11 01:55:05,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca6d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:55:05, skipping insertion in model container [2022-01-11 01:55:05,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:04" (2/4) ... [2022-01-11 01:55:05,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca6d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:55:05, skipping insertion in model container [2022-01-11 01:55:05,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:05" (3/4) ... [2022-01-11 01:55:05,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca6d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:55:05, skipping insertion in model container [2022-01-11 01:55:05,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:55:05" (4/4) ... [2022-01-11 01:55:05,596 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.cTransformedIcfg [2022-01-11 01:55:05,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:55:05,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 01:55:05,630 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:55:05,634 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:55:05,634 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 01:55:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:55:05,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:05,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:05,659 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1470062608, now seen corresponding path program 1 times [2022-01-11 01:55:05,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167754365] [2022-01-11 01:55:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:05,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:55:05,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:05,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167754365] [2022-01-11 01:55:05,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167754365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:05,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:05,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:05,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589519499] [2022-01-11 01:55:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:05,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:05,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:05,839 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:05,968 INFO L93 Difference]: Finished difference Result 383 states and 657 transitions. [2022-01-11 01:55:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-11 01:55:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:05,984 INFO L225 Difference]: With dead ends: 383 [2022-01-11 01:55:05,984 INFO L226 Difference]: Without dead ends: 217 [2022-01-11 01:55:05,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:05,992 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 170 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:05,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 415 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-11 01:55:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-01-11 01:55:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5231481481481481) internal successors, (329), 216 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2022-01-11 01:55:06,027 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 44 [2022-01-11 01:55:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,028 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2022-01-11 01:55:06,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2022-01-11 01:55:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:55:06,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:06,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:55:06,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -721572004, now seen corresponding path program 1 times [2022-01-11 01:55:06,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693516081] [2022-01-11 01:55:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,100 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-11 01:55:06,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693516081] [2022-01-11 01:55:06,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693516081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488320337] [2022-01-11 01:55:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,103 INFO L87 Difference]: Start difference. First operand 217 states and 329 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-11 01:55:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,130 INFO L93 Difference]: Finished difference Result 427 states and 652 transitions. [2022-01-11 01:55:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,130 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 60 [2022-01-11 01:55:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,132 INFO L225 Difference]: With dead ends: 427 [2022-01-11 01:55:06,132 INFO L226 Difference]: Without dead ends: 321 [2022-01-11 01:55:06,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,134 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 127 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-01-11 01:55:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-01-11 01:55:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.521875) internal successors, (487), 320 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 487 transitions. [2022-01-11 01:55:06,148 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 487 transitions. Word has length 60 [2022-01-11 01:55:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,148 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 487 transitions. [2022-01-11 01:55:06,148 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-11 01:55:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 487 transitions. [2022-01-11 01:55:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 01:55:06,151 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:06,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:55:06,152 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1561404299, now seen corresponding path program 1 times [2022-01-11 01:55:06,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748313980] [2022-01-11 01:55:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,219 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-11 01:55:06,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748313980] [2022-01-11 01:55:06,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748313980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242233011] [2022-01-11 01:55:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,221 INFO L87 Difference]: Start difference. First operand 321 states and 487 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-11 01:55:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,350 INFO L93 Difference]: Finished difference Result 772 states and 1194 transitions. [2022-01-11 01:55:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,350 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 81 [2022-01-11 01:55:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,352 INFO L225 Difference]: With dead ends: 772 [2022-01-11 01:55:06,352 INFO L226 Difference]: Without dead ends: 459 [2022-01-11 01:55:06,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,354 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 273 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-11 01:55:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 447. [2022-01-11 01:55:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4080717488789238) internal successors, (628), 446 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2022-01-11 01:55:06,383 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 81 [2022-01-11 01:55:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,384 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2022-01-11 01:55:06,384 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-11 01:55:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2022-01-11 01:55:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 01:55:06,386 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:06,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:55:06,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1437331052, now seen corresponding path program 1 times [2022-01-11 01:55:06,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504048016] [2022-01-11 01:55:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,435 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-11 01:55:06,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504048016] [2022-01-11 01:55:06,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504048016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148440140] [2022-01-11 01:55:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,437 INFO L87 Difference]: Start difference. First operand 447 states and 628 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-11 01:55:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,552 INFO L93 Difference]: Finished difference Result 964 states and 1367 transitions. [2022-01-11 01:55:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,552 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 81 [2022-01-11 01:55:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,554 INFO L225 Difference]: With dead ends: 964 [2022-01-11 01:55:06,554 INFO L226 Difference]: Without dead ends: 525 [2022-01-11 01:55:06,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,556 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-01-11 01:55:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2022-01-11 01:55:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.3825242718446602) internal successors, (712), 515 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 712 transitions. [2022-01-11 01:55:06,567 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 712 transitions. Word has length 81 [2022-01-11 01:55:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,567 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 712 transitions. [2022-01-11 01:55:06,567 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-11 01:55:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 712 transitions. [2022-01-11 01:55:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-11 01:55:06,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:06,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:55:06,569 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1590319401, now seen corresponding path program 1 times [2022-01-11 01:55:06,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589741539] [2022-01-11 01:55:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,616 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-11 01:55:06,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589741539] [2022-01-11 01:55:06,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589741539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988396799] [2022-01-11 01:55:06,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,618 INFO L87 Difference]: Start difference. First operand 516 states and 712 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,714 INFO L93 Difference]: Finished difference Result 1135 states and 1595 transitions. [2022-01-11 01:55:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-01-11 01:55:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,716 INFO L225 Difference]: With dead ends: 1135 [2022-01-11 01:55:06,717 INFO L226 Difference]: Without dead ends: 627 [2022-01-11 01:55:06,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,718 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-01-11 01:55:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 591. [2022-01-11 01:55:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.3593220338983052) internal successors, (802), 590 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 802 transitions. [2022-01-11 01:55:06,729 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 802 transitions. Word has length 101 [2022-01-11 01:55:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,729 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 802 transitions. [2022-01-11 01:55:06,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 802 transitions. [2022-01-11 01:55:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:55:06,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-01-11 01:55:06,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:55:06,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 169636065, now seen corresponding path program 1 times [2022-01-11 01:55:06,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865134781] [2022-01-11 01:55:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 01:55:06,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865134781] [2022-01-11 01:55:06,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865134781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581146646] [2022-01-11 01:55:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,807 INFO L87 Difference]: Start difference. First operand 591 states and 802 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,829 INFO L93 Difference]: Finished difference Result 787 states and 1069 transitions. [2022-01-11 01:55:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-11 01:55:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,832 INFO L225 Difference]: With dead ends: 787 [2022-01-11 01:55:06,832 INFO L226 Difference]: Without dead ends: 785 [2022-01-11 01:55:06,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,833 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 126 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 318 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-01-11 01:55:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-01-11 01:55:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 1.3609693877551021) internal successors, (1067), 784 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1067 transitions. [2022-01-11 01:55:06,846 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1067 transitions. Word has length 121 [2022-01-11 01:55:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,846 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1067 transitions. [2022-01-11 01:55:06,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1067 transitions. [2022-01-11 01:55:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-11 01:55:06,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,848 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 01:55:06,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:55:06,849 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 765636099, now seen corresponding path program 1 times [2022-01-11 01:55:06,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744611370] [2022-01-11 01:55:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-11 01:55:06,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744611370] [2022-01-11 01:55:06,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744611370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063956655] [2022-01-11 01:55:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,895 INFO L87 Difference]: Start difference. First operand 785 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:07,016 INFO L93 Difference]: Finished difference Result 1734 states and 2426 transitions. [2022-01-11 01:55:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 01:55:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:07,019 INFO L225 Difference]: With dead ends: 1734 [2022-01-11 01:55:07,019 INFO L226 Difference]: Without dead ends: 957 [2022-01-11 01:55:07,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,020 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:07,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-01-11 01:55:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 949. [2022-01-11 01:55:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.3196202531645569) internal successors, (1251), 948 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1251 transitions. [2022-01-11 01:55:07,033 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1251 transitions. Word has length 183 [2022-01-11 01:55:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:07,033 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1251 transitions. [2022-01-11 01:55:07,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1251 transitions. [2022-01-11 01:55:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 01:55:07,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:07,035 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:07,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:55:07,035 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -891359820, now seen corresponding path program 1 times [2022-01-11 01:55:07,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612130123] [2022-01-11 01:55:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:07,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-01-11 01:55:07,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612130123] [2022-01-11 01:55:07,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612130123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:07,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:07,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:07,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819906389] [2022-01-11 01:55:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:07,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:07,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,080 INFO L87 Difference]: Start difference. First operand 949 states and 1251 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:07,201 INFO L93 Difference]: Finished difference Result 2062 states and 2794 transitions. [2022-01-11 01:55:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 189 [2022-01-11 01:55:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:07,204 INFO L225 Difference]: With dead ends: 2062 [2022-01-11 01:55:07,204 INFO L226 Difference]: Without dead ends: 1121 [2022-01-11 01:55:07,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,205 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 58 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:07,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-01-11 01:55:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1073. [2022-01-11 01:55:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1072 states have (on average 1.3162313432835822) internal successors, (1411), 1072 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1411 transitions. [2022-01-11 01:55:07,221 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1411 transitions. Word has length 189 [2022-01-11 01:55:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:07,222 INFO L470 AbstractCegarLoop]: Abstraction has 1073 states and 1411 transitions. [2022-01-11 01:55:07,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1411 transitions. [2022-01-11 01:55:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-11 01:55:07,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:07,224 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2022-01-11 01:55:07,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:55:07,224 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash -113656609, now seen corresponding path program 1 times [2022-01-11 01:55:07,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:07,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201534318] [2022-01-11 01:55:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:07,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-11 01:55:07,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201534318] [2022-01-11 01:55:07,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201534318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:07,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:07,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:07,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108901449] [2022-01-11 01:55:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:07,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:07,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,271 INFO L87 Difference]: Start difference. First operand 1073 states and 1411 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:07,387 INFO L93 Difference]: Finished difference Result 2274 states and 2990 transitions. [2022-01-11 01:55:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:07,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 215 [2022-01-11 01:55:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:07,391 INFO L225 Difference]: With dead ends: 2274 [2022-01-11 01:55:07,391 INFO L226 Difference]: Without dead ends: 1209 [2022-01-11 01:55:07,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,393 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:07,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-01-11 01:55:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1181. [2022-01-11 01:55:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1180 states have (on average 1.3042372881355933) internal successors, (1539), 1180 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1539 transitions. [2022-01-11 01:55:07,410 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1539 transitions. Word has length 215 [2022-01-11 01:55:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:07,410 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1539 transitions. [2022-01-11 01:55:07,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1539 transitions. [2022-01-11 01:55:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-11 01:55:07,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:07,413 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:07,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:55:07,413 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1019569640, now seen corresponding path program 1 times [2022-01-11 01:55:07,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:07,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233452541] [2022-01-11 01:55:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:07,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-01-11 01:55:07,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233452541] [2022-01-11 01:55:07,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233452541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:07,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:07,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:07,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691669432] [2022-01-11 01:55:07,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:07,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:07,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,472 INFO L87 Difference]: Start difference. First operand 1181 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:07,518 INFO L93 Difference]: Finished difference Result 3519 states and 4581 transitions. [2022-01-11 01:55:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 216 [2022-01-11 01:55:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:07,524 INFO L225 Difference]: With dead ends: 3519 [2022-01-11 01:55:07,524 INFO L226 Difference]: Without dead ends: 2346 [2022-01-11 01:55:07,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,526 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:07,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 493 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2022-01-11 01:55:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2344. [2022-01-11 01:55:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 1.2996158770806658) internal successors, (3045), 2343 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3045 transitions. [2022-01-11 01:55:07,568 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3045 transitions. Word has length 216 [2022-01-11 01:55:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:07,569 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 3045 transitions. [2022-01-11 01:55:07,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3045 transitions. [2022-01-11 01:55:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-11 01:55:07,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:07,573 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:55:07,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:55:07,573 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 145956202, now seen corresponding path program 1 times [2022-01-11 01:55:07,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:07,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223463223] [2022-01-11 01:55:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:07,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-11 01:55:07,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:07,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223463223] [2022-01-11 01:55:07,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223463223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:07,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:07,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:07,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311150206] [2022-01-11 01:55:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:07,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:07,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,621 INFO L87 Difference]: Start difference. First operand 2344 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:07,798 INFO L93 Difference]: Finished difference Result 5024 states and 6686 transitions. [2022-01-11 01:55:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 217 [2022-01-11 01:55:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:07,804 INFO L225 Difference]: With dead ends: 5024 [2022-01-11 01:55:07,805 INFO L226 Difference]: Without dead ends: 2592 [2022-01-11 01:55:07,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,807 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:07,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 254 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-01-11 01:55:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2592. [2022-01-11 01:55:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.2863759166345041) internal successors, (3333), 2591 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3333 transitions. [2022-01-11 01:55:07,856 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3333 transitions. Word has length 217 [2022-01-11 01:55:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:07,857 INFO L470 AbstractCegarLoop]: Abstraction has 2592 states and 3333 transitions. [2022-01-11 01:55:07,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3333 transitions. [2022-01-11 01:55:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-01-11 01:55:07,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:07,861 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-11 01:55:07,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:55:07,861 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1486722301, now seen corresponding path program 1 times [2022-01-11 01:55:07,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:07,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146228620] [2022-01-11 01:55:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:07,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-01-11 01:55:07,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146228620] [2022-01-11 01:55:07,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146228620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:07,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:07,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:07,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300687159] [2022-01-11 01:55:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:07,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:07,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:07,910 INFO L87 Difference]: Start difference. First operand 2592 states and 3333 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:08,032 INFO L93 Difference]: Finished difference Result 5424 states and 6966 transitions. [2022-01-11 01:55:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 242 [2022-01-11 01:55:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:08,039 INFO L225 Difference]: With dead ends: 5424 [2022-01-11 01:55:08,039 INFO L226 Difference]: Without dead ends: 2840 [2022-01-11 01:55:08,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:08,042 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:08,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-01-11 01:55:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2824. [2022-01-11 01:55:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2823 states have (on average 1.2770102727594757) internal successors, (3605), 2823 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3605 transitions. [2022-01-11 01:55:08,160 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3605 transitions. Word has length 242 [2022-01-11 01:55:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:08,160 INFO L470 AbstractCegarLoop]: Abstraction has 2824 states and 3605 transitions. [2022-01-11 01:55:08,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3605 transitions. [2022-01-11 01:55:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-01-11 01:55:08,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:08,167 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2022-01-11 01:55:08,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:55:08,167 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:08,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash 966612412, now seen corresponding path program 1 times [2022-01-11 01:55:08,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:08,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700994243] [2022-01-11 01:55:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:08,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-11 01:55:08,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700994243] [2022-01-11 01:55:08,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700994243] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197011714] [2022-01-11 01:55:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:08,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:08,247 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-11 01:55:08,252 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-11 01:55:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:08,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 01:55:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:55:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-01-11 01:55:08,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 01:55:08,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197011714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:08,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 01:55:08,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 01:55:08,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504207544] [2022-01-11 01:55:08,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:08,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:08,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:55:08,845 INFO L87 Difference]: Start difference. First operand 2824 states and 3605 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:08,908 INFO L93 Difference]: Finished difference Result 5642 states and 7208 transitions. [2022-01-11 01:55:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 245 [2022-01-11 01:55:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:08,917 INFO L225 Difference]: With dead ends: 5642 [2022-01-11 01:55:08,917 INFO L226 Difference]: Without dead ends: 3528 [2022-01-11 01:55:08,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-11 01:55:08,920 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:08,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 319 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2022-01-11 01:55:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3528. [2022-01-11 01:55:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3527 states have (on average 1.2770059540686136) internal successors, (4504), 3527 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4504 transitions. [2022-01-11 01:55:09,010 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4504 transitions. Word has length 245 [2022-01-11 01:55:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:09,010 INFO L470 AbstractCegarLoop]: Abstraction has 3528 states and 4504 transitions. [2022-01-11 01:55:09,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4504 transitions. [2022-01-11 01:55:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 01:55:09,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:09,016 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 01:55:09,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 01:55:09,231 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,SelfDestructingSolverStorable12 [2022-01-11 01:55:09,232 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1426361015, now seen corresponding path program 1 times [2022-01-11 01:55:09,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:09,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740279782] [2022-01-11 01:55:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:09,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 01:55:09,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740279782] [2022-01-11 01:55:09,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740279782] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614369138] [2022-01-11 01:55:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:09,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:09,282 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-11 01:55:09,283 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-11 01:55:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:09,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 01:55:09,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:55:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 01:55:09,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:55:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 01:55:10,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614369138] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:55:10,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:55:10,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 01:55:10,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690035420] [2022-01-11 01:55:10,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:55:10,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 01:55:10,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:10,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 01:55:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 01:55:10,051 INFO L87 Difference]: Start difference. First operand 3528 states and 4504 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:10,656 INFO L93 Difference]: Finished difference Result 13800 states and 18121 transitions. [2022-01-11 01:55:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 01:55:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2022-01-11 01:55:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:10,694 INFO L225 Difference]: With dead ends: 13800 [2022-01-11 01:55:10,694 INFO L226 Difference]: Without dead ends: 10280 [2022-01-11 01:55:10,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 01:55:10,700 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 336 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:10,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1222 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 01:55:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10280 states. [2022-01-11 01:55:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10280 to 6506. [2022-01-11 01:55:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6505 states have (on average 1.2759415833973866) internal successors, (8300), 6505 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 8300 transitions. [2022-01-11 01:55:10,879 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 8300 transitions. Word has length 253 [2022-01-11 01:55:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:10,879 INFO L470 AbstractCegarLoop]: Abstraction has 6506 states and 8300 transitions. [2022-01-11 01:55:10,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 8300 transitions. [2022-01-11 01:55:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 01:55:10,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:10,887 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 01:55:10,907 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-11 01:55:11,104 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,SelfDestructingSolverStorable13 [2022-01-11 01:55:11,105 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1281951320, now seen corresponding path program 1 times [2022-01-11 01:55:11,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:11,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371574087] [2022-01-11 01:55:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:11,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-01-11 01:55:11,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371574087] [2022-01-11 01:55:11,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371574087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:11,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:11,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:11,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099612454] [2022-01-11 01:55:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:11,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:11,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:11,144 INFO L87 Difference]: Start difference. First operand 6506 states and 8300 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:11,300 INFO L93 Difference]: Finished difference Result 18432 states and 23616 transitions. [2022-01-11 01:55:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 253 [2022-01-11 01:55:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:11,312 INFO L225 Difference]: With dead ends: 18432 [2022-01-11 01:55:11,312 INFO L226 Difference]: Without dead ends: 7844 [2022-01-11 01:55:11,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:11,323 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 491 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-11 01:55:11,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 491 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-01-11 01:55:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7385. [2022-01-11 01:55:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7385 states, 7384 states have (on average 1.2918472372697725) internal successors, (9539), 7384 states have internal predecessors, (9539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 9539 transitions. [2022-01-11 01:55:11,463 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 9539 transitions. Word has length 253 [2022-01-11 01:55:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:11,463 INFO L470 AbstractCegarLoop]: Abstraction has 7385 states and 9539 transitions. [2022-01-11 01:55:11,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 9539 transitions. [2022-01-11 01:55:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-01-11 01:55:11,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:11,472 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 01:55:11,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:55:11,472 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1005740019, now seen corresponding path program 1 times [2022-01-11 01:55:11,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440798849] [2022-01-11 01:55:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:11,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-01-11 01:55:11,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:11,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440798849] [2022-01-11 01:55:11,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440798849] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:11,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279984531] [2022-01-11 01:55:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:11,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:11,598 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-11 01:55:11,599 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-11 01:55:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:11,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 01:55:11,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:55:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-01-11 01:55:12,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 01:55:12,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279984531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:12,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 01:55:12,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 01:55:12,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202769935] [2022-01-11 01:55:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:12,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:12,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:55:12,745 INFO L87 Difference]: Start difference. First operand 7385 states and 9539 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:12,842 INFO L93 Difference]: Finished difference Result 9215 states and 11928 transitions. [2022-01-11 01:55:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-01-11 01:55:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:12,854 INFO L225 Difference]: With dead ends: 9215 [2022-01-11 01:55:12,854 INFO L226 Difference]: Without dead ends: 7248 [2022-01-11 01:55:12,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 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-11 01:55:12,859 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:12,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2022-01-11 01:55:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 5236. [2022-01-11 01:55:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5235 states have (on average 1.2913085004775549) internal successors, (6760), 5235 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 6760 transitions. [2022-01-11 01:55:13,004 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 6760 transitions. Word has length 355 [2022-01-11 01:55:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:13,004 INFO L470 AbstractCegarLoop]: Abstraction has 5236 states and 6760 transitions. [2022-01-11 01:55:13,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 6760 transitions. [2022-01-11 01:55:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2022-01-11 01:55:13,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:13,012 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2022-01-11 01:55:13,032 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-11 01:55:13,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:13,229 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -523215483, now seen corresponding path program 1 times [2022-01-11 01:55:13,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:13,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799620276] [2022-01-11 01:55:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:13,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-01-11 01:55:13,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:13,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799620276] [2022-01-11 01:55:13,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799620276] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542877741] [2022-01-11 01:55:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:13,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:13,310 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-11 01:55:13,311 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-11 01:55:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:13,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 01:55:13,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:55:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-01-11 01:55:14,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:55:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-01-11 01:55:14,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542877741] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:55:14,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:55:14,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 01:55:14,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522425041] [2022-01-11 01:55:14,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:55:14,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 01:55:14,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 01:55:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 01:55:14,493 INFO L87 Difference]: Start difference. First operand 5236 states and 6760 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:14,919 INFO L93 Difference]: Finished difference Result 12710 states and 16838 transitions. [2022-01-11 01:55:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 01:55:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 417 [2022-01-11 01:55:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:14,931 INFO L225 Difference]: With dead ends: 12710 [2022-01-11 01:55:14,931 INFO L226 Difference]: Without dead ends: 7272 [2022-01-11 01:55:14,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-11 01:55:14,938 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 387 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:14,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 494 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 01:55:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2022-01-11 01:55:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6191. [2022-01-11 01:55:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 6190 states have (on average 1.3460420032310179) internal successors, (8332), 6190 states have internal predecessors, (8332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 8332 transitions. [2022-01-11 01:55:15,058 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 8332 transitions. Word has length 417 [2022-01-11 01:55:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:15,058 INFO L470 AbstractCegarLoop]: Abstraction has 6191 states and 8332 transitions. [2022-01-11 01:55:15,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8332 transitions. [2022-01-11 01:55:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-01-11 01:55:15,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:15,068 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:15,089 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-11 01:55:15,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-11 01:55:15,287 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 713430023, now seen corresponding path program 1 times [2022-01-11 01:55:15,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133766690] [2022-01-11 01:55:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:15,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-01-11 01:55:15,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133766690] [2022-01-11 01:55:15,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133766690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:15,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:15,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:15,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031687086] [2022-01-11 01:55:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:15,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:15,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:15,358 INFO L87 Difference]: Start difference. First operand 6191 states and 8332 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:15,577 INFO L93 Difference]: Finished difference Result 12804 states and 17345 transitions. [2022-01-11 01:55:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 509 [2022-01-11 01:55:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:15,587 INFO L225 Difference]: With dead ends: 12804 [2022-01-11 01:55:15,587 INFO L226 Difference]: Without dead ends: 6621 [2022-01-11 01:55:15,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:15,594 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 93 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:15,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 216 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:55:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2022-01-11 01:55:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 6425. [2022-01-11 01:55:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6425 states, 6424 states have (on average 1.3460460772104608) internal successors, (8647), 6424 states have internal predecessors, (8647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8647 transitions. [2022-01-11 01:55:15,716 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8647 transitions. Word has length 509 [2022-01-11 01:55:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:15,716 INFO L470 AbstractCegarLoop]: Abstraction has 6425 states and 8647 transitions. [2022-01-11 01:55:15,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8647 transitions. [2022-01-11 01:55:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2022-01-11 01:55:15,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:15,726 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 01:55:15,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:55:15,727 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash 673852091, now seen corresponding path program 1 times [2022-01-11 01:55:15,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:15,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646598644] [2022-01-11 01:55:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:15,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1986 proven. 16 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2022-01-11 01:55:15,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646598644] [2022-01-11 01:55:15,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646598644] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103410301] [2022-01-11 01:55:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:15,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:15,813 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-11 01:55:15,815 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-11 01:55:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:16,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 1940 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-11 01:55:16,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:55:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-01-11 01:55:17,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:55:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-01-11 01:55:17,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103410301] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:55:17,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:55:17,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-01-11 01:55:17,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73303900] [2022-01-11 01:55:17,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:55:17,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:55:17,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:55:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:55:17,940 INFO L87 Difference]: Start difference. First operand 6425 states and 8647 transitions. Second operand has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:19,144 INFO L93 Difference]: Finished difference Result 17871 states and 24239 transitions. [2022-01-11 01:55:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-11 01:55:19,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 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 513 [2022-01-11 01:55:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:19,145 INFO L225 Difference]: With dead ends: 17871 [2022-01-11 01:55:19,145 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 01:55:19,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2022-01-11 01:55:19,157 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 723 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:19,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 1492 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1512 Invalid, 0 Unknown, 520 Unchecked, 0.8s Time] [2022-01-11 01:55:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 01:55:19,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 01:55:19,158 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-11 01:55:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 01:55:19,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 513 [2022-01-11 01:55:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:19,158 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 01:55:19,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 01:55:19,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 01:55:19,160 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 01:55:19,189 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-11 01:55:19,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:19,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 01:55:30,390 WARN L228 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 847 DAG size of output: 817 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-11 01:55:39,432 WARN L228 SmtUtils]: Spent 8.97s on a formula simplification. DAG size of input: 857 DAG size of output: 826 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-11 01:55:49,628 WARN L228 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 812 DAG size of output: 82 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-11 01:55:55,249 WARN L228 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 821 DAG size of output: 82 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-11 01:55:55,561 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 01:55:55,561 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 76 685) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L861 garLoopResultBuilder]: At program point L683(lines 76 685) the Hoare annotation is: true [2022-01-11 01:55:55,562 INFO L854 garLoopResultBuilder]: At program point L111-2(lines 111 667) the Hoare annotation is: (let ((.cse4 (mod (+ (mod (* |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_Y~0#1Int| 2) 4294967296) (mod (* 2 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_X~0#1Int|) 4294967296)) 4294967296))) (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse5 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse10 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse9 (<= .cse4 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1)) (.cse7 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 .cse2) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (and .cse3 (<= .cse4 8496)) (and .cse5 .cse6 .cse2) (and .cse1 .cse6 .cse7) (and .cse5 .cse6 .cse7) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576) (<= 8466 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse6 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse5 .cse0) (and .cse1 .cse9 .cse0) (and .cse5 .cse6 .cse10 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse2) (and (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse3 (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (and .cse5 .cse6 .cse10 .cse8) (and .cse9 .cse3) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse7) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 01:55:55,562 INFO L861 garLoopResultBuilder]: At program point L684(lines 19 686) the Hoare annotation is: true [2022-01-11 01:55:55,562 INFO L861 garLoopResultBuilder]: At program point L668(lines 110 669) the Hoare annotation is: true [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-11 01:55:55,562 INFO L861 garLoopResultBuilder]: At program point L696(lines 687 698) the Hoare annotation is: true [2022-01-11 01:55:55,562 INFO L858 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 636) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L672-2(lines 672 676) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L861 garLoopResultBuilder]: At program point L115(lines 114 636) the Hoare annotation is: true [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 635) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L861 garLoopResultBuilder]: At program point L224(lines 117 635) the Hoare annotation is: true [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 634) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 633) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L229-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 632) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 631) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L858 garLoopResultBuilder]: For program point L241-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,563 INFO L854 garLoopResultBuilder]: At program point L133(lines 129 631) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse1 (<= 8466 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse2 .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2))) [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 630) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 279) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 629) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L854 garLoopResultBuilder]: At program point L599(lines 111 667) the Hoare annotation is: (let ((.cse4 (mod (+ (mod (* |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_Y~0#1Int| 2) 4294967296) (mod (* 2 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_X~0#1Int|) 4294967296)) 4294967296))) (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse5 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse10 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse9 (<= .cse4 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1)) (.cse7 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 .cse2) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (and .cse3 (<= .cse4 8496)) (and .cse5 .cse6 .cse2) (and .cse1 .cse6 .cse7) (and .cse5 .cse6 .cse7) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576) (<= 8466 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse6 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse5 .cse0) (and .cse1 .cse9 .cse0) (and .cse5 .cse6 .cse10 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse2) (and (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse3 (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (and .cse5 .cse6 .cse10 .cse8) (and .cse9 .cse3) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse7) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 01:55:55,564 INFO L854 garLoopResultBuilder]: At program point L136(lines 135 629) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse1 (<= 8466 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse2 .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2))) [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 628) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 662) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 665) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L854 garLoopResultBuilder]: At program point L145(lines 138 628) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 .cse0) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse1))) [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 627) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 648) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 626) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 645) no Hoare annotation was computed. [2022-01-11 01:55:55,564 INFO L858 garLoopResultBuilder]: For program point L639-2(lines 638 660) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L302-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 625) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L650(lines 650 656) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L854 garLoopResultBuilder]: At program point L151(lines 147 625) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (.cse1 (<= 8466 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse2 .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2))) [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 624) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 327) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 623) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L322-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L854 garLoopResultBuilder]: At program point L157(lines 153 623) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 622) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 342 351) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 621) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L333-2(lines 333 337) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L854 garLoopResultBuilder]: At program point L163(lines 159 621) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 620) no Hoare annotation was computed. [2022-01-11 01:55:55,565 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 362) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 619) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L358-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L854 garLoopResultBuilder]: At program point L169(lines 165 619) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 618) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L854 garLoopResultBuilder]: At program point L380(lines 363 398) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 397) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 436) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 617) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L369(lines 369 396) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 436) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,566 INFO L854 garLoopResultBuilder]: At program point L175(lines 171 617) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L174(lines 174 616) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 369 396) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 393) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 422) no Hoare annotation was computed. [2022-01-11 01:55:55,566 INFO L854 garLoopResultBuilder]: At program point L424(lines 415 435) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)))) [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 615) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 392) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 431) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L854 garLoopResultBuilder]: At program point L178(lines 177 615) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448))) (or (and (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and .cse2 .cse3 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) (<= (mod (+ (mod (* |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_Y~0#1Int| 2) 4294967296) (mod (* 2 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~ag_X~0#1Int|) 4294967296)) 4294967296) 8496)) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse0 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse3 .cse1))) [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 614) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L374(lines 374 378) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 464) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L456-1(lines 456 468) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L854 garLoopResultBuilder]: At program point L184(lines 180 614) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse2))) [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 613) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L374-2(lines 373 390) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 612) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L854 garLoopResultBuilder]: At program point L190(lines 186 612) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))))) [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 611) no Hoare annotation was computed. [2022-01-11 01:55:55,567 INFO L858 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 610) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L854 garLoopResultBuilder]: At program point L196(lines 192 610) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse2))) [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 609) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 608) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L854 garLoopResultBuilder]: At program point L202(lines 198 608) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse1 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse2 (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse2))) [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 607) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L517(lines 517 521) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 606) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 526) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L854 garLoopResultBuilder]: At program point L208(lines 204 606) the Hoare annotation is: (let ((.cse0 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0))) [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 605) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L522-2(lines 522 526) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 537) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 604) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L858 garLoopResultBuilder]: For program point L539(lines 539 543) no Hoare annotation was computed. [2022-01-11 01:55:55,568 INFO L854 garLoopResultBuilder]: At program point L214(lines 210 604) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse1))) [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 603) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L539-2(lines 221 598) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L561(lines 561 565) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 602) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L551(lines 551 556) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L854 garLoopResultBuilder]: At program point L562(lines 76 685) the Hoare annotation is: false [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L566(lines 566 570) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L861 garLoopResultBuilder]: At program point L217(lines 216 602) the Hoare annotation is: true [2022-01-11 01:55:55,569 INFO L861 garLoopResultBuilder]: At program point L220(lines 219 601) the Hoare annotation is: true [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 679) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L572(lines 572 576) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 592) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L572-2(lines 572 576) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-01-11 01:55:55,569 INFO L858 garLoopResultBuilder]: For program point L582-1(lines 582 592) no Hoare annotation was computed. [2022-01-11 01:55:55,572 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] [2022-01-11 01:55:55,573 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 01:55:55,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:55:55 BasicIcfg [2022-01-11 01:55:55,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 01:55:55,605 INFO L158 Benchmark]: Toolchain (without parser) took 51359.04ms. Allocated memory was 191.9MB in the beginning and 621.8MB in the end (delta: 429.9MB). Free memory was 142.2MB in the beginning and 308.8MB in the end (delta: -166.6MB). Peak memory consumption was 363.0MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,605 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 191.9MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 01:55:55,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.67ms. Allocated memory is still 191.9MB. Free memory was 141.9MB in the beginning and 165.3MB in the end (delta: -23.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.21ms. Allocated memory is still 191.9MB. Free memory was 165.3MB in the beginning and 162.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,606 INFO L158 Benchmark]: Boogie Preprocessor took 21.93ms. Allocated memory is still 191.9MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,606 INFO L158 Benchmark]: RCFGBuilder took 713.50ms. Allocated memory is still 191.9MB. Free memory was 160.6MB in the beginning and 133.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,606 INFO L158 Benchmark]: IcfgTransformer took 196.54ms. Allocated memory is still 191.9MB. Free memory was 133.8MB in the beginning and 118.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,606 INFO L158 Benchmark]: TraceAbstraction took 50012.77ms. Allocated memory was 191.9MB in the beginning and 621.8MB in the end (delta: 429.9MB). Free memory was 118.1MB in the beginning and 308.8MB in the end (delta: -190.7MB). Peak memory consumption was 338.9MB. Max. memory is 8.0GB. [2022-01-11 01:55:55,607 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.16ms. Allocated memory is still 191.9MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.67ms. Allocated memory is still 191.9MB. Free memory was 141.9MB in the beginning and 165.3MB in the end (delta: -23.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.21ms. Allocated memory is still 191.9MB. Free memory was 165.3MB in the beginning and 162.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.93ms. Allocated memory is still 191.9MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 713.50ms. Allocated memory is still 191.9MB. Free memory was 160.6MB in the beginning and 133.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 196.54ms. Allocated memory is still 191.9MB. Free memory was 133.8MB in the beginning and 118.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 50012.77ms. Allocated memory was 191.9MB in the beginning and 621.8MB in the end (delta: 429.9MB). Free memory was 118.1MB in the beginning and 308.8MB in the end (delta: -190.7MB). Peak memory consumption was 338.9MB. 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: 679]: 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, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.9s, OverallIterations: 19, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2606 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2606 mSDsluCounter, 8391 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 520 IncrementalHoareTripleChecker+Unchecked, 4096 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3875 IncrementalHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 4295 mSDtfsCounter, 3875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3062 GetRequests, 3008 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7385occurred in iteration=15, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 7681 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1479 NumberOfFragments, 1061 HoareAnnotationTreeSize, 29 FomulaSimplifications, 46915 FormulaSimplificationTreeSizeReduction, 20.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 147143 FormulaSimplificationTreeSizeReductionInter, 15.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 6078 NumberOfCodeBlocks, 6078 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7234 ConstructedInterpolants, 35 QuantifiedInterpolants, 18917 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6814 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 27302/27869 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: 171]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8640bv32, s__state)) || (~bvule32(blastFlag, 1bv32) && ~bvule32(8640bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) && ~bvule32(8466bv32, s__state)) || (((~bvule32(s__state, 8576bv32) && ~bvule32(8466bv32, s__state)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) && ~bvule32(8466bv32, s__state)) || (((~bvule32(s__state, 8576bv32) && ~bvule32(8466bv32, s__state)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) && ~bvule32(8466bv32, s__state)) || (((~bvule32(s__state, 8576bv32) && ~bvule32(8466bv32, s__state)) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state))) || (((~bvule32(blastFlag, 2bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8640bv32, s__state)) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || (((~bvule32(blastFlag, 2bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8640bv32, s__state)) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || (~bvule32(blastFlag, 1bv32) && ~bvule32(8672bv32, s__state))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || (~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || (~bvule32(blastFlag, 1bv32) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], s__state))) || ~bvule32(blastFlag, 0bv32)) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || (~bvule32(blastFlag, 1bv32) && 8656bv32 == s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state))) || ((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], s__state))) || (~bvule32(blastFlag, 1bv32) && ~bvule32(8672bv32, s__state))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) && ~bvule32(8466bv32, s__state))) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || (~bvule32(blastFlag, 1bv32) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], 8496bv32))) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 1bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8656bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8544bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((~bvule32(blastFlag, 1bv32) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], 8496bv32)) && ~bvule32(s__state, 8448bv32)) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 8448bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8448bv32))) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8448bv32)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || (~bvule32(blastFlag, 1bv32) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], s__state))) || ~bvule32(blastFlag, 0bv32)) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || (~bvule32(blastFlag, 1bv32) && 8656bv32 == s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state))) || ((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], s__state))) || (~bvule32(blastFlag, 1bv32) && ~bvule32(8672bv32, s__state))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state))) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 1bv32)) && ~bvule32(8466bv32, s__state))) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || (~bvule32(blastFlag, 1bv32) && ~bvule32(~bvadd16(~zero_extendFrom32To33((ag_Y ++ 0bv1)[31:0]), ~zero_extendFrom32To33(~bvmul32(2bv33, ~zero_extendFrom32To33(ag_X))[31:0]))[31:0], 8496bv32))) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 1bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8656bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 1bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8544bv32, s__state))) || (((~bvule32(blastFlag, 2bv32) && !~bvule32(8656bv32, s__state)) && ~bvule32(8544bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-11 01:55:55,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...