/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:46:14,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:46:14,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:46:15,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:46:15,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:46:15,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:46:15,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:46:15,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:46:15,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:46:15,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:46:15,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:46:15,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:46:15,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:46:15,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:46:15,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:46:15,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:46:15,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:46:15,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:46:15,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:46:15,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:46:15,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:46:15,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:46:15,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:46:15,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:46:15,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:46:15,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:46:15,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:46:15,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:46:15,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:46:15,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:46:15,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:46:15,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:46:15,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:46:15,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:46:15,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:46:15,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:46:15,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:46:15,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:46:15,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:46:15,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:46:15,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:46:15,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:46:15,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:46:15,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:46:15,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:46:15,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:46:15,123 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:46:15,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:46:15,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:46:15,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:46:15,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:46:15,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:46:15,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:46:15,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:46:15,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:46:15,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:46:15,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:46:15,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:46:15,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:46:15,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:46:15,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:46:15,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:46:15,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:46:15,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:46:15,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:46:15,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:46:15,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:46:15,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2020-12-23 01:46:15,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:46:15,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:46:15,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:46:15,599 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:46:15,600 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:46:15,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-12-23 01:46:15,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47167e43f/e58e33bacd8047c085ea6bfda87098cf/FLAG06db87279 [2020-12-23 01:46:16,533 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:46:16,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-12-23 01:46:16,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47167e43f/e58e33bacd8047c085ea6bfda87098cf/FLAG06db87279 [2020-12-23 01:46:16,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47167e43f/e58e33bacd8047c085ea6bfda87098cf [2020-12-23 01:46:16,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:46:16,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:46:16,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:16,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:46:16,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:46:16,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:16" (1/1) ... [2020-12-23 01:46:16,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f1fea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:16, skipping insertion in model container [2020-12-23 01:46:16,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:16" (1/1) ... [2020-12-23 01:46:16,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:46:16,847 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:17,364 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:17,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:17,409 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:17,585 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[71320,71333] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:17,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:17,645 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:46:17,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17 WrapperNode [2020-12-23 01:46:17,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:17,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:17,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:46:17,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:46:17,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:17,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:46:17,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:46:17,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:46:17,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... [2020-12-23 01:46:17,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:46:17,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:46:17,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:46:17,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:46:17,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:46:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:46:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:46:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:46:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:46:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:46:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:46:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:46:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:46:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:46:18,498 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:46:19,585 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:46:19,585 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:46:19,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:46:19,596 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:46:19,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:19 BoogieIcfgContainer [2020-12-23 01:46:19,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:46:19,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:46:19,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:46:19,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:46:19,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:46:16" (1/3) ... [2020-12-23 01:46:19,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16268434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:46:19, skipping insertion in model container [2020-12-23 01:46:19,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:17" (2/3) ... [2020-12-23 01:46:19,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16268434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:46:19, skipping insertion in model container [2020-12-23 01:46:19,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:19" (3/3) ... [2020-12-23 01:46:19,607 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2020-12-23 01:46:19,614 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:46:19,619 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:46:19,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:46:19,670 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:46:19,670 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:46:19,670 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:46:19,670 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:46:19,670 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:46:19,671 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:46:19,671 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:46:19,671 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:46:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 01:46:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:46:19,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:19,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:19,702 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2020-12-23 01:46:19,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:19,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403688793] [2020-12-23 01:46:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:20,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403688793] [2020-12-23 01:46:20,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:20,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:20,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995757193] [2020-12-23 01:46:20,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:20,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:20,230 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2020-12-23 01:46:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:20,858 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2020-12-23 01:46:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:20,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-23 01:46:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:20,877 INFO L225 Difference]: With dead ends: 313 [2020-12-23 01:46:20,877 INFO L226 Difference]: Without dead ends: 158 [2020-12-23 01:46:20,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-23 01:46:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-23 01:46:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2020-12-23 01:46:20,937 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2020-12-23 01:46:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:20,938 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2020-12-23 01:46:20,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2020-12-23 01:46:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:46:20,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:20,942 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:20,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:46:20,943 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2020-12-23 01:46:20,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:20,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740286407] [2020-12-23 01:46:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:21,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740286407] [2020-12-23 01:46:21,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:21,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:21,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139090892] [2020-12-23 01:46:21,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:21,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:21,175 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2020-12-23 01:46:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:21,681 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2020-12-23 01:46:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:21,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:46:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:21,686 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:46:21,686 INFO L226 Difference]: Without dead ends: 158 [2020-12-23 01:46:21,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-23 01:46:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-23 01:46:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2020-12-23 01:46:21,705 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2020-12-23 01:46:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:21,707 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2020-12-23 01:46:21,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2020-12-23 01:46:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:46:21,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:21,712 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:21,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:46:21,714 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2020-12-23 01:46:21,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:21,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049540637] [2020-12-23 01:46:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:21,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049540637] [2020-12-23 01:46:21,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:21,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:21,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314369619] [2020-12-23 01:46:21,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:21,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:21,893 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2020-12-23 01:46:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:22,325 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2020-12-23 01:46:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:22,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:46:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:22,328 INFO L225 Difference]: With dead ends: 279 [2020-12-23 01:46:22,328 INFO L226 Difference]: Without dead ends: 157 [2020-12-23 01:46:22,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-23 01:46:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2020-12-23 01:46:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2020-12-23 01:46:22,341 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2020-12-23 01:46:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:22,341 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2020-12-23 01:46:22,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2020-12-23 01:46:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:46:22,343 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:22,343 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:22,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:46:22,344 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2020-12-23 01:46:22,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:22,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532008648] [2020-12-23 01:46:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:22,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532008648] [2020-12-23 01:46:22,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:22,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:22,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909083974] [2020-12-23 01:46:22,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:22,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:22,447 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2020-12-23 01:46:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:22,852 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2020-12-23 01:46:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:22,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:46:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:22,854 INFO L225 Difference]: With dead ends: 277 [2020-12-23 01:46:22,854 INFO L226 Difference]: Without dead ends: 155 [2020-12-23 01:46:22,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-23 01:46:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2020-12-23 01:46:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2020-12-23 01:46:22,864 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2020-12-23 01:46:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:22,865 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2020-12-23 01:46:22,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2020-12-23 01:46:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:46:22,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:22,867 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:22,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:46:22,867 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2020-12-23 01:46:22,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:22,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919534048] [2020-12-23 01:46:22,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:22,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919534048] [2020-12-23 01:46:22,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:22,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:22,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58274102] [2020-12-23 01:46:22,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:22,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:22,952 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2020-12-23 01:46:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:23,364 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2020-12-23 01:46:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:23,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:46:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:23,368 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:46:23,368 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:46:23,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:46:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:46:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2020-12-23 01:46:23,379 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2020-12-23 01:46:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:23,379 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2020-12-23 01:46:23,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2020-12-23 01:46:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:46:23,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:23,381 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:23,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:46:23,382 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2020-12-23 01:46:23,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:23,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732894410] [2020-12-23 01:46:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:23,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732894410] [2020-12-23 01:46:23,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:23,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:23,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928476040] [2020-12-23 01:46:23,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:23,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:23,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:23,498 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2020-12-23 01:46:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:23,945 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2020-12-23 01:46:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:23,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:46:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:23,948 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:46:23,948 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:46:23,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:46:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:46:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2020-12-23 01:46:23,957 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2020-12-23 01:46:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:23,957 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2020-12-23 01:46:23,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2020-12-23 01:46:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 01:46:23,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:23,958 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:23,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:46:23,959 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2020-12-23 01:46:23,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:23,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834220691] [2020-12-23 01:46:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:24,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834220691] [2020-12-23 01:46:24,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:24,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:24,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261506352] [2020-12-23 01:46:24,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:24,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:24,045 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2020-12-23 01:46:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:24,446 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2020-12-23 01:46:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:24,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 01:46:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:24,448 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:46:24,448 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:46:24,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:46:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:46:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2020-12-23 01:46:24,456 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2020-12-23 01:46:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:24,456 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2020-12-23 01:46:24,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2020-12-23 01:46:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:46:24,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:24,458 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:24,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:46:24,458 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2020-12-23 01:46:24,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:24,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553179420] [2020-12-23 01:46:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:24,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553179420] [2020-12-23 01:46:24,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:24,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:24,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346157338] [2020-12-23 01:46:24,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:24,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:24,526 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2020-12-23 01:46:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:24,919 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2020-12-23 01:46:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:24,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 01:46:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:24,922 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:46:24,922 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:46:24,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:46:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:46:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2020-12-23 01:46:24,930 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2020-12-23 01:46:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:24,930 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2020-12-23 01:46:24,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2020-12-23 01:46:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:46:24,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:24,932 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:24,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:46:24,932 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2020-12-23 01:46:24,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:24,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628714424] [2020-12-23 01:46:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:25,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628714424] [2020-12-23 01:46:25,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:25,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:25,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495352193] [2020-12-23 01:46:25,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:25,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:25,008 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2020-12-23 01:46:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:25,389 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2020-12-23 01:46:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:25,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:46:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:25,391 INFO L225 Difference]: With dead ends: 266 [2020-12-23 01:46:25,391 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 01:46:25,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 01:46:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2020-12-23 01:46:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:46:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2020-12-23 01:46:25,398 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2020-12-23 01:46:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:25,399 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2020-12-23 01:46:25,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2020-12-23 01:46:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:46:25,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:25,409 INFO L422 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, 1, 1] [2020-12-23 01:46:25,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:46:25,409 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2020-12-23 01:46:25,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:25,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714405809] [2020-12-23 01:46:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:25,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714405809] [2020-12-23 01:46:25,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:25,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:25,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938189779] [2020-12-23 01:46:25,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:25,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:25,543 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2020-12-23 01:46:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:25,969 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2020-12-23 01:46:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:25,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:46:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:25,972 INFO L225 Difference]: With dead ends: 306 [2020-12-23 01:46:25,972 INFO L226 Difference]: Without dead ends: 184 [2020-12-23 01:46:25,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-23 01:46:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-23 01:46:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2020-12-23 01:46:25,980 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2020-12-23 01:46:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:25,981 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2020-12-23 01:46:25,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2020-12-23 01:46:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:46:25,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:25,982 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:25,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:46:25,983 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2020-12-23 01:46:25,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:25,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326391731] [2020-12-23 01:46:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:26,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326391731] [2020-12-23 01:46:26,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:26,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:26,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805421779] [2020-12-23 01:46:26,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:26,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:26,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:26,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:26,058 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2020-12-23 01:46:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:26,480 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2020-12-23 01:46:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:26,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:46:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:26,483 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:46:26,484 INFO L226 Difference]: Without dead ends: 184 [2020-12-23 01:46:26,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-23 01:46:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-23 01:46:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2020-12-23 01:46:26,492 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2020-12-23 01:46:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:26,492 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2020-12-23 01:46:26,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2020-12-23 01:46:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:46:26,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:26,494 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:26,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:46:26,494 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2020-12-23 01:46:26,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:26,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203791492] [2020-12-23 01:46:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:26,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203791492] [2020-12-23 01:46:26,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:26,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:26,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224563013] [2020-12-23 01:46:26,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:26,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:26,577 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2020-12-23 01:46:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:26,988 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2020-12-23 01:46:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:26,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:46:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:26,990 INFO L225 Difference]: With dead ends: 327 [2020-12-23 01:46:26,990 INFO L226 Difference]: Without dead ends: 183 [2020-12-23 01:46:26,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-23 01:46:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2020-12-23 01:46:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2020-12-23 01:46:26,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2020-12-23 01:46:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:26,999 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2020-12-23 01:46:26,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2020-12-23 01:46:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:46:27,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:27,000 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-12-23 01:46:27,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:46:27,001 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2020-12-23 01:46:27,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:27,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375126909] [2020-12-23 01:46:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:27,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375126909] [2020-12-23 01:46:27,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:27,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:27,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111110904] [2020-12-23 01:46:27,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:27,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:27,070 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2020-12-23 01:46:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:27,451 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2020-12-23 01:46:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:27,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:46:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:27,453 INFO L225 Difference]: With dead ends: 325 [2020-12-23 01:46:27,454 INFO L226 Difference]: Without dead ends: 181 [2020-12-23 01:46:27,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-23 01:46:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-12-23 01:46:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2020-12-23 01:46:27,461 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2020-12-23 01:46:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:27,462 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2020-12-23 01:46:27,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2020-12-23 01:46:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:46:27,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:27,463 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:27,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:46:27,464 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2020-12-23 01:46:27,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:27,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618456423] [2020-12-23 01:46:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:27,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618456423] [2020-12-23 01:46:27,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:27,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:27,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424611750] [2020-12-23 01:46:27,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:27,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:27,540 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2020-12-23 01:46:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:27,973 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2020-12-23 01:46:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:27,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:46:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:27,975 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:46:27,976 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:46:27,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:46:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:46:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2020-12-23 01:46:27,986 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2020-12-23 01:46:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:27,986 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2020-12-23 01:46:27,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2020-12-23 01:46:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:46:27,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:27,988 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:27,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:46:27,989 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2020-12-23 01:46:27,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:27,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043580915] [2020-12-23 01:46:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:28,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043580915] [2020-12-23 01:46:28,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:28,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:28,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638941586] [2020-12-23 01:46:28,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:28,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:28,061 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2020-12-23 01:46:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:28,541 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2020-12-23 01:46:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:28,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:46:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:28,544 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:46:28,544 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:46:28,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:46:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:46:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2020-12-23 01:46:28,560 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2020-12-23 01:46:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:28,561 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2020-12-23 01:46:28,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2020-12-23 01:46:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 01:46:28,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:28,563 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-12-23 01:46:28,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:46:28,564 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2020-12-23 01:46:28,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:28,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826482017] [2020-12-23 01:46:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:28,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826482017] [2020-12-23 01:46:28,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:28,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:28,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613548820] [2020-12-23 01:46:28,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:28,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:28,662 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2020-12-23 01:46:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:29,095 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2020-12-23 01:46:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:29,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 01:46:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:29,097 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:46:29,098 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:46:29,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:46:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:46:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-12-23 01:46:29,106 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2020-12-23 01:46:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:29,106 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-12-23 01:46:29,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-12-23 01:46:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 01:46:29,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:29,108 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-23 01:46:29,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:46:29,108 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2020-12-23 01:46:29,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:29,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281846567] [2020-12-23 01:46:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:29,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281846567] [2020-12-23 01:46:29,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:29,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:29,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971023599] [2020-12-23 01:46:29,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:29,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:29,197 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2020-12-23 01:46:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:29,573 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2020-12-23 01:46:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:29,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 01:46:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:29,575 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:46:29,575 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:46:29,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:46:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:46:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2020-12-23 01:46:29,581 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2020-12-23 01:46:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:29,582 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2020-12-23 01:46:29,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2020-12-23 01:46:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 01:46:29,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:29,583 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:29,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:46:29,583 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2020-12-23 01:46:29,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:29,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139531672] [2020-12-23 01:46:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:29,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139531672] [2020-12-23 01:46:29,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:29,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:29,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007257693] [2020-12-23 01:46:29,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:29,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:29,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:29,644 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2020-12-23 01:46:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:29,997 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2020-12-23 01:46:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:29,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 01:46:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:29,999 INFO L225 Difference]: With dead ends: 314 [2020-12-23 01:46:29,999 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:46:30,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:46:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2020-12-23 01:46:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:46:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2020-12-23 01:46:30,005 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2020-12-23 01:46:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:30,007 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2020-12-23 01:46:30,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2020-12-23 01:46:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:46:30,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:30,008 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:30,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:46:30,008 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2020-12-23 01:46:30,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:30,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874293381] [2020-12-23 01:46:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:30,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874293381] [2020-12-23 01:46:30,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:30,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:30,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337136344] [2020-12-23 01:46:30,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:30,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:30,169 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2020-12-23 01:46:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:30,780 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2020-12-23 01:46:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:30,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:46:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:30,785 INFO L225 Difference]: With dead ends: 402 [2020-12-23 01:46:30,785 INFO L226 Difference]: Without dead ends: 258 [2020-12-23 01:46:30,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-12-23 01:46:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2020-12-23 01:46:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 01:46:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2020-12-23 01:46:30,796 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2020-12-23 01:46:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:30,797 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2020-12-23 01:46:30,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2020-12-23 01:46:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:46:30,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:30,798 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:30,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:46:30,799 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2020-12-23 01:46:30,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:30,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505331240] [2020-12-23 01:46:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:30,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505331240] [2020-12-23 01:46:30,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:30,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:30,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149371764] [2020-12-23 01:46:30,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:30,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:30,889 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2020-12-23 01:46:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:31,384 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2020-12-23 01:46:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:31,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:46:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:31,387 INFO L225 Difference]: With dead ends: 442 [2020-12-23 01:46:31,387 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:46:31,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:46:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-23 01:46:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2020-12-23 01:46:31,396 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2020-12-23 01:46:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:31,396 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2020-12-23 01:46:31,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2020-12-23 01:46:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:31,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:31,398 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:31,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:46:31,398 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2020-12-23 01:46:31,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:31,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204059027] [2020-12-23 01:46:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:31,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204059027] [2020-12-23 01:46:31,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:31,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:31,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295726208] [2020-12-23 01:46:31,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:31,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:31,490 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2020-12-23 01:46:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:32,077 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2020-12-23 01:46:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:32,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:32,080 INFO L225 Difference]: With dead ends: 493 [2020-12-23 01:46:32,080 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 01:46:32,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 01:46:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2020-12-23 01:46:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2020-12-23 01:46:32,089 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2020-12-23 01:46:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:32,089 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2020-12-23 01:46:32,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2020-12-23 01:46:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:32,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:32,091 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:32,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:46:32,091 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2020-12-23 01:46:32,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:32,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869468285] [2020-12-23 01:46:32,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:32,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869468285] [2020-12-23 01:46:32,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:32,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:32,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124808576] [2020-12-23 01:46:32,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:32,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:32,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:32,168 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2020-12-23 01:46:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:32,651 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2020-12-23 01:46:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:32,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:32,654 INFO L225 Difference]: With dead ends: 466 [2020-12-23 01:46:32,654 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:46:32,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:46:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-23 01:46:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2020-12-23 01:46:32,662 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2020-12-23 01:46:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:32,662 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2020-12-23 01:46:32,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2020-12-23 01:46:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:32,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:32,664 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:32,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:46:32,664 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2020-12-23 01:46:32,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:32,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734153219] [2020-12-23 01:46:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:32,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734153219] [2020-12-23 01:46:32,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:32,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:32,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64114096] [2020-12-23 01:46:32,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:32,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:32,739 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2020-12-23 01:46:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:33,326 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2020-12-23 01:46:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:33,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:33,328 INFO L225 Difference]: With dead ends: 492 [2020-12-23 01:46:33,328 INFO L226 Difference]: Without dead ends: 281 [2020-12-23 01:46:33,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-23 01:46:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2020-12-23 01:46:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2020-12-23 01:46:33,339 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2020-12-23 01:46:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:33,339 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2020-12-23 01:46:33,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2020-12-23 01:46:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:33,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:33,341 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:33,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:46:33,341 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2020-12-23 01:46:33,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:33,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666582374] [2020-12-23 01:46:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:33,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666582374] [2020-12-23 01:46:33,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:33,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:33,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950071092] [2020-12-23 01:46:33,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:33,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:33,421 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2020-12-23 01:46:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:34,053 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2020-12-23 01:46:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:34,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:34,056 INFO L225 Difference]: With dead ends: 490 [2020-12-23 01:46:34,056 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 01:46:34,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 01:46:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-12-23 01:46:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2020-12-23 01:46:34,064 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2020-12-23 01:46:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:34,064 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2020-12-23 01:46:34,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2020-12-23 01:46:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:34,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:34,066 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:34,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:46:34,066 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2020-12-23 01:46:34,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:34,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523353703] [2020-12-23 01:46:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:34,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523353703] [2020-12-23 01:46:34,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:34,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:34,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210135145] [2020-12-23 01:46:34,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:34,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:34,143 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2020-12-23 01:46:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:34,729 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2020-12-23 01:46:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:34,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:34,731 INFO L225 Difference]: With dead ends: 489 [2020-12-23 01:46:34,732 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 01:46:34,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 01:46:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2020-12-23 01:46:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2020-12-23 01:46:34,740 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2020-12-23 01:46:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:34,740 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2020-12-23 01:46:34,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2020-12-23 01:46:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:34,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:34,742 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:34,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:46:34,742 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2020-12-23 01:46:34,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:34,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312843577] [2020-12-23 01:46:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 01:46:34,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312843577] [2020-12-23 01:46:34,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:34,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:46:34,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25036741] [2020-12-23 01:46:34,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:46:34,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:46:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:34,865 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2020-12-23 01:46:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:35,441 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2020-12-23 01:46:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:46:35,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 01:46:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:35,443 INFO L225 Difference]: With dead ends: 462 [2020-12-23 01:46:35,444 INFO L226 Difference]: Without dead ends: 251 [2020-12-23 01:46:35,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:46:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-23 01:46:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2020-12-23 01:46:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2020-12-23 01:46:35,452 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2020-12-23 01:46:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:35,453 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2020-12-23 01:46:35,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:46:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2020-12-23 01:46:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:35,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:35,454 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:35,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:46:35,455 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2020-12-23 01:46:35,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:35,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086647296] [2020-12-23 01:46:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:35,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086647296] [2020-12-23 01:46:35,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:35,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:35,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520802888] [2020-12-23 01:46:35,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:35,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:35,530 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2020-12-23 01:46:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:35,979 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2020-12-23 01:46:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:35,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:35,982 INFO L225 Difference]: With dead ends: 503 [2020-12-23 01:46:35,982 INFO L226 Difference]: Without dead ends: 272 [2020-12-23 01:46:35,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-23 01:46:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-12-23 01:46:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2020-12-23 01:46:35,991 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2020-12-23 01:46:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:35,991 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2020-12-23 01:46:35,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2020-12-23 01:46:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:35,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:35,993 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:35,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:46:35,993 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2020-12-23 01:46:35,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:35,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537622458] [2020-12-23 01:46:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:36,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537622458] [2020-12-23 01:46:36,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:36,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:36,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582249473] [2020-12-23 01:46:36,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:36,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:36,083 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2020-12-23 01:46:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:36,498 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2020-12-23 01:46:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:36,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:36,502 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:36,503 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:36,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2020-12-23 01:46:36,512 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2020-12-23 01:46:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:36,512 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2020-12-23 01:46:36,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2020-12-23 01:46:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:36,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:36,514 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:36,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:46:36,514 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2020-12-23 01:46:36,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:36,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278250788] [2020-12-23 01:46:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:36,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278250788] [2020-12-23 01:46:36,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:36,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:36,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036788171] [2020-12-23 01:46:36,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:36,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:36,587 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2020-12-23 01:46:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:37,124 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2020-12-23 01:46:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:37,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:37,127 INFO L225 Difference]: With dead ends: 529 [2020-12-23 01:46:37,128 INFO L226 Difference]: Without dead ends: 298 [2020-12-23 01:46:37,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-12-23 01:46:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-12-23 01:46:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2020-12-23 01:46:37,138 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2020-12-23 01:46:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:37,139 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2020-12-23 01:46:37,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2020-12-23 01:46:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:37,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:37,140 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:37,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:46:37,141 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2020-12-23 01:46:37,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:37,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717454932] [2020-12-23 01:46:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:37,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717454932] [2020-12-23 01:46:37,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:37,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:37,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111407300] [2020-12-23 01:46:37,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:37,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:37,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:37,231 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2020-12-23 01:46:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:37,658 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2020-12-23 01:46:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:37,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:37,660 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:37,661 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:37,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2020-12-23 01:46:37,670 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2020-12-23 01:46:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:37,670 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2020-12-23 01:46:37,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2020-12-23 01:46:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:37,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:37,672 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:37,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:46:37,672 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:37,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2020-12-23 01:46:37,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:37,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374404369] [2020-12-23 01:46:37,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:37,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374404369] [2020-12-23 01:46:37,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:37,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:37,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513967299] [2020-12-23 01:46:37,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:37,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:37,741 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2020-12-23 01:46:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:38,283 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2020-12-23 01:46:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:38,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:38,287 INFO L225 Difference]: With dead ends: 529 [2020-12-23 01:46:38,287 INFO L226 Difference]: Without dead ends: 298 [2020-12-23 01:46:38,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-12-23 01:46:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-12-23 01:46:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2020-12-23 01:46:38,301 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2020-12-23 01:46:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:38,302 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2020-12-23 01:46:38,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2020-12-23 01:46:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:38,303 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:38,303 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:38,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:46:38,304 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2020-12-23 01:46:38,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:38,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123625300] [2020-12-23 01:46:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:38,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123625300] [2020-12-23 01:46:38,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:38,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:38,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88184677] [2020-12-23 01:46:38,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:38,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:38,396 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2020-12-23 01:46:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:38,888 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2020-12-23 01:46:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:38,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:38,891 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:38,891 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:38,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2020-12-23 01:46:38,901 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2020-12-23 01:46:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:38,901 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2020-12-23 01:46:38,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2020-12-23 01:46:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:38,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:38,903 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:38,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:46:38,904 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2020-12-23 01:46:38,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:38,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395298265] [2020-12-23 01:46:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:38,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395298265] [2020-12-23 01:46:38,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:38,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:38,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891285763] [2020-12-23 01:46:38,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:38,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:38,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:38,978 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2020-12-23 01:46:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:39,564 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2020-12-23 01:46:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:39,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:39,567 INFO L225 Difference]: With dead ends: 529 [2020-12-23 01:46:39,567 INFO L226 Difference]: Without dead ends: 298 [2020-12-23 01:46:39,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-12-23 01:46:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-12-23 01:46:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2020-12-23 01:46:39,581 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2020-12-23 01:46:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:39,582 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2020-12-23 01:46:39,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2020-12-23 01:46:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:39,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:39,584 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:39,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:46:39,584 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2020-12-23 01:46:39,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:39,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401158888] [2020-12-23 01:46:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:39,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401158888] [2020-12-23 01:46:39,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:39,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:39,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461512912] [2020-12-23 01:46:39,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:39,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:39,713 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2020-12-23 01:46:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:40,201 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2020-12-23 01:46:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:40,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:40,204 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:40,204 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:40,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-12-23 01:46:40,216 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2020-12-23 01:46:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:40,217 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-12-23 01:46:40,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-12-23 01:46:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:46:40,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:40,219 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:40,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:46:40,219 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2020-12-23 01:46:40,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:40,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636597137] [2020-12-23 01:46:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:40,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636597137] [2020-12-23 01:46:40,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:40,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:40,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575228670] [2020-12-23 01:46:40,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:40,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:40,320 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2020-12-23 01:46:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:40,972 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2020-12-23 01:46:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:40,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:46:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:40,975 INFO L225 Difference]: With dead ends: 519 [2020-12-23 01:46:40,975 INFO L226 Difference]: Without dead ends: 288 [2020-12-23 01:46:40,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-23 01:46:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2020-12-23 01:46:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2020-12-23 01:46:40,987 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2020-12-23 01:46:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:40,987 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2020-12-23 01:46:40,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2020-12-23 01:46:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:46:40,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:40,989 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:40,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:46:40,989 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2020-12-23 01:46:40,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:40,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085111070] [2020-12-23 01:46:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:41,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085111070] [2020-12-23 01:46:41,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:41,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:41,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508783247] [2020-12-23 01:46:41,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:41,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:41,085 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2020-12-23 01:46:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:41,536 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2020-12-23 01:46:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:41,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:46:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:41,541 INFO L225 Difference]: With dead ends: 492 [2020-12-23 01:46:41,541 INFO L226 Difference]: Without dead ends: 261 [2020-12-23 01:46:41,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-23 01:46:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2020-12-23 01:46:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2020-12-23 01:46:41,561 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2020-12-23 01:46:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:41,562 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2020-12-23 01:46:41,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2020-12-23 01:46:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:41,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:41,563 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:41,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:46:41,563 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2020-12-23 01:46:41,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:41,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156112183] [2020-12-23 01:46:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:41,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156112183] [2020-12-23 01:46:41,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:41,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:41,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713152837] [2020-12-23 01:46:41,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:41,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:41,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:41,678 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2020-12-23 01:46:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,234 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2020-12-23 01:46:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:42,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 01:46:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,237 INFO L225 Difference]: With dead ends: 519 [2020-12-23 01:46:42,238 INFO L226 Difference]: Without dead ends: 288 [2020-12-23 01:46:42,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-23 01:46:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2020-12-23 01:46:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2020-12-23 01:46:42,249 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2020-12-23 01:46:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,249 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2020-12-23 01:46:42,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2020-12-23 01:46:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:42,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,250 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:42,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:46:42,251 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2020-12-23 01:46:42,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504150429] [2020-12-23 01:46:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 01:46:42,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504150429] [2020-12-23 01:46:42,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:42,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:42,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131944392] [2020-12-23 01:46:42,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:42,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:42,325 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2020-12-23 01:46:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,394 INFO L93 Difference]: Finished difference Result 707 states and 1055 transitions. [2020-12-23 01:46:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:42,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,397 INFO L225 Difference]: With dead ends: 707 [2020-12-23 01:46:42,398 INFO L226 Difference]: Without dead ends: 476 [2020-12-23 01:46:42,398 INFO L677 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 [2020-12-23 01:46:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2020-12-23 01:46:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2020-12-23 01:46:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2020-12-23 01:46:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 705 transitions. [2020-12-23 01:46:42,418 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 705 transitions. Word has length 106 [2020-12-23 01:46:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,418 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 705 transitions. [2020-12-23 01:46:42,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 705 transitions. [2020-12-23 01:46:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:42,420 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,420 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:42,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:46:42,421 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580761, now seen corresponding path program 1 times [2020-12-23 01:46:42,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084747100] [2020-12-23 01:46:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 01:46:42,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084747100] [2020-12-23 01:46:42,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:42,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:42,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499985029] [2020-12-23 01:46:42,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:42,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:42,478 INFO L87 Difference]: Start difference. First operand 476 states and 705 transitions. Second operand 3 states. [2020-12-23 01:46:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,566 INFO L93 Difference]: Finished difference Result 960 states and 1425 transitions. [2020-12-23 01:46:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:42,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,569 INFO L225 Difference]: With dead ends: 960 [2020-12-23 01:46:42,569 INFO L226 Difference]: Without dead ends: 503 [2020-12-23 01:46:42,571 INFO L677 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 [2020-12-23 01:46:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-12-23 01:46:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2020-12-23 01:46:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-12-23 01:46:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 740 transitions. [2020-12-23 01:46:42,589 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 740 transitions. Word has length 106 [2020-12-23 01:46:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,589 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 740 transitions. [2020-12-23 01:46:42,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 740 transitions. [2020-12-23 01:46:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:42,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,591 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:42,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:46:42,592 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash 555304539, now seen corresponding path program 1 times [2020-12-23 01:46:42,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629028656] [2020-12-23 01:46:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-23 01:46:42,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629028656] [2020-12-23 01:46:42,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:42,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:42,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724811255] [2020-12-23 01:46:42,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:42,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:42,643 INFO L87 Difference]: Start difference. First operand 503 states and 740 transitions. Second operand 3 states. [2020-12-23 01:46:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,673 INFO L93 Difference]: Finished difference Result 989 states and 1461 transitions. [2020-12-23 01:46:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:42,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,676 INFO L225 Difference]: With dead ends: 989 [2020-12-23 01:46:42,677 INFO L226 Difference]: Without dead ends: 505 [2020-12-23 01:46:42,678 INFO L677 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 [2020-12-23 01:46:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-12-23 01:46:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2020-12-23 01:46:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2020-12-23 01:46:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 742 transitions. [2020-12-23 01:46:42,700 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 742 transitions. Word has length 106 [2020-12-23 01:46:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,700 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 742 transitions. [2020-12-23 01:46:42,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 742 transitions. [2020-12-23 01:46:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 01:46:42,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,703 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:42,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:46:42,704 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2020-12-23 01:46:42,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107992901] [2020-12-23 01:46:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:46:42,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:46:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:46:43,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:46:43,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:46:43,188 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:46:43,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:46:43,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:46:43 BoogieIcfgContainer [2020-12-23 01:46:43,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:46:43,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:46:43,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:46:43,410 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:46:43,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:19" (3/4) ... [2020-12-23 01:46:43,414 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:46:43,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:46:43,417 INFO L168 Benchmark]: Toolchain (without parser) took 26706.28 ms. Allocated memory was 151.0 MB in the beginning and 310.4 MB in the end (delta: 159.4 MB). Free memory was 124.9 MB in the beginning and 232.6 MB in the end (delta: -107.7 MB). Peak memory consumption was 52.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:43,418 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:46:43,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 931.08 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 93.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:43,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.45 ms. Allocated memory is still 151.0 MB. Free memory was 93.3 MB in the beginning and 88.8 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:43,419 INFO L168 Benchmark]: Boogie Preprocessor took 161.27 ms. Allocated memory is still 151.0 MB. Free memory was 88.8 MB in the beginning and 81.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:43,420 INFO L168 Benchmark]: RCFGBuilder took 1606.88 ms. Allocated memory is still 151.0 MB. Free memory was 81.9 MB in the beginning and 69.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:43,420 INFO L168 Benchmark]: TraceAbstraction took 23810.20 ms. Allocated memory was 151.0 MB in the beginning and 310.4 MB in the end (delta: 159.4 MB). Free memory was 69.4 MB in the beginning and 233.2 MB in the end (delta: -163.8 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:46:43,420 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 310.4 MB. Free memory was 233.2 MB in the beginning and 232.6 MB in the end (delta: 553.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:46:43,423 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.26 ms. Allocated memory is still 151.0 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 931.08 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 93.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 179.45 ms. Allocated memory is still 151.0 MB. Free memory was 93.3 MB in the beginning and 88.8 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 161.27 ms. Allocated memory is still 151.0 MB. Free memory was 88.8 MB in the beginning and 81.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1606.88 ms. Allocated memory is still 151.0 MB. Free memory was 81.9 MB in the beginning and 69.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23810.20 ms. Allocated memory was 151.0 MB in the beginning and 310.4 MB in the end (delta: 159.4 MB). Free memory was 69.4 MB in the beginning and 233.2 MB in the end (delta: -163.8 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 4.65 ms. Allocated memory is still 310.4 MB. Free memory was 233.2 MB in the beginning and 232.6 MB in the end (delta: 553.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1704]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] COND FALSE !(! tmp___9) [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 2 [L1561] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L1704] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7516 SDtfs, 2089 SDslu, 10975 SDs, 0 SdLazy, 6884 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 763149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...