/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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:39:11,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:39:11,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:39:11,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:39:11,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:39:11,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:39:11,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:39:11,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:39:11,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:39:11,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:39:11,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:39:11,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:39:11,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:39:11,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:39:11,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:39:11,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:39:11,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:39:11,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:39:11,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:39:11,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:39:11,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:39:11,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:39:11,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:39:11,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:39:11,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:39:11,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:39:11,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:39:11,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:39:11,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:39:11,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:39:11,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:39:11,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:39:11,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:39:11,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:39:11,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:39:11,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:39:11,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:39:11,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:39:11,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:39:11,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:39:11,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:39:11,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:39:11,996 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:39:11,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:39:12,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:39:12,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:39:12,002 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:39:12,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:39:12,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:39:12,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:39:12,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:39:12,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:39:12,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:39:12,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:39:12,004 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:39:12,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:39:12,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:39:12,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:39:12,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:39:12,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:39:12,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:39:12,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:39:12,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:39:12,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:39:12,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:39:12,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:39:12,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:39:12,007 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 [2021-01-06 11:39:12,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:39:12,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:39:12,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:39:12,390 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:39:12,390 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:39:12,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-01-06 11:39:12,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019de8e08/2446dd10df8e488891ca8a635be73a04/FLAGb2a67d502 [2021-01-06 11:39:13,188 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:39:13,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-01-06 11:39:13,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019de8e08/2446dd10df8e488891ca8a635be73a04/FLAGb2a67d502 [2021-01-06 11:39:13,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019de8e08/2446dd10df8e488891ca8a635be73a04 [2021-01-06 11:39:13,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:39:13,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:39:13,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:39:13,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:39:13,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:39:13,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:39:13" (1/1) ... [2021-01-06 11:39:13,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71400ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:13, skipping insertion in model container [2021-01-06 11:39:13,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:39:13" (1/1) ... [2021-01-06 11:39:13,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:39:13,537 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[~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[~tmp___3~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[~tmp___4~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[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[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~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem72,],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~mem84,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem84,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem85,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem85,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] 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~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem102,],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~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem107,],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~mem108,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem108,],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~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem110,],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~mem111,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem111,],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~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~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: 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: 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem123,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem123,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~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[~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[~tmp___10~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[72],StructAccessExpression[IdentifierExpression[~s,],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[#t~mem132,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem132,],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,] [2021-01-06 11:39:14,152 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.01.i.cil-2.c[71733,71746] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:39:14,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:39:14,193 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[~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[~tmp___3~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[~tmp___4~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[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[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~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem72,],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~mem84,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem84,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem85,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem85,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] 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~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem102,],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~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem107,],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~mem108,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem108,],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~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem110,],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~mem111,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem111,],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~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~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: 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: 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem123,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem123,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~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[~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[~tmp___10~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[72],StructAccessExpression[IdentifierExpression[~s,],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[#t~mem132,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem132,],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,] [2021-01-06 11:39:14,369 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.01.i.cil-2.c[71733,71746] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:39:14,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:39:14,402 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:39:14,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14 WrapperNode [2021-01-06 11:39:14,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:39:14,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:39:14,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:39:14,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:39:14,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:39:14,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:39:14,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:39:14,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:39:14,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (1/1) ... [2021-01-06 11:39:14,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:39:14,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:39:14,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:39:14,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:39:14,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (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 [2021-01-06 11:39:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:39:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:39:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:39:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:39:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:39:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:39:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:39:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:39:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:39:15,028 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:39:16,102 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:39:16,102 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:39:16,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:39:16,113 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:39:16,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:16 BoogieIcfgContainer [2021-01-06 11:39:16,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:39:16,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:39:16,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:39:16,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:39:16,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:39:13" (1/3) ... [2021-01-06 11:39:16,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f86689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:39:16, skipping insertion in model container [2021-01-06 11:39:16,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:14" (2/3) ... [2021-01-06 11:39:16,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f86689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:39:16, skipping insertion in model container [2021-01-06 11:39:16,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:16" (3/3) ... [2021-01-06 11:39:16,124 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2021-01-06 11:39:16,130 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:39:16,136 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:39:16,155 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:39:16,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:39:16,184 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:39:16,184 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:39:16,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:39:16,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:39:16,184 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:39:16,184 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:39:16,185 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:39:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2021-01-06 11:39:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:39:16,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:16,214 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] [2021-01-06 11:39:16,215 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2021-01-06 11:39:16,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:16,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090360260] [2021-01-06 11:39:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:16,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090360260] [2021-01-06 11:39:16,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:16,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:16,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729121007] [2021-01-06 11:39:16,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:16,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:16,689 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2021-01-06 11:39:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:17,355 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2021-01-06 11:39:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:17,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2021-01-06 11:39:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:17,370 INFO L225 Difference]: With dead ends: 317 [2021-01-06 11:39:17,370 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:39:17,374 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 [2021-01-06 11:39:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:39:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-01-06 11:39:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-01-06 11:39:17,423 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2021-01-06 11:39:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:17,423 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-01-06 11:39:17,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-01-06 11:39:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 11:39:17,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:17,427 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] [2021-01-06 11:39:17,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:39:17,427 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2021-01-06 11:39:17,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:17,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426058003] [2021-01-06 11:39:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:17,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426058003] [2021-01-06 11:39:17,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:17,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:17,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079447536] [2021-01-06 11:39:17,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:17,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:17,667 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2021-01-06 11:39:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:18,186 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2021-01-06 11:39:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:18,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 11:39:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:18,189 INFO L225 Difference]: With dead ends: 284 [2021-01-06 11:39:18,192 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:39:18,193 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 [2021-01-06 11:39:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:39:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-01-06 11:39:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-01-06 11:39:18,216 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2021-01-06 11:39:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:18,217 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-01-06 11:39:18,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-01-06 11:39:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:39:18,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:18,220 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] [2021-01-06 11:39:18,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:39:18,220 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2021-01-06 11:39:18,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:18,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289211559] [2021-01-06 11:39:18,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:18,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289211559] [2021-01-06 11:39:18,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:18,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:18,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112526520] [2021-01-06 11:39:18,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:18,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:18,339 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2021-01-06 11:39:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:18,705 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2021-01-06 11:39:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:18,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:39:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:18,708 INFO L225 Difference]: With dead ends: 282 [2021-01-06 11:39:18,709 INFO L226 Difference]: Without dead ends: 158 [2021-01-06 11:39:18,710 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 [2021-01-06 11:39:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-01-06 11:39:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-01-06 11:39:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-01-06 11:39:18,721 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2021-01-06 11:39:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:18,722 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-01-06 11:39:18,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-01-06 11:39:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:39:18,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:18,725 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] [2021-01-06 11:39:18,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:39:18,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2021-01-06 11:39:18,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:18,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921203648] [2021-01-06 11:39:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:18,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921203648] [2021-01-06 11:39:18,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:18,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:18,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948734266] [2021-01-06 11:39:18,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:18,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:18,836 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2021-01-06 11:39:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:19,301 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2021-01-06 11:39:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:19,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:39:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:19,303 INFO L225 Difference]: With dead ends: 281 [2021-01-06 11:39:19,303 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 11:39:19,304 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 [2021-01-06 11:39:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 11:39:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-01-06 11:39:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-01-06 11:39:19,315 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2021-01-06 11:39:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:19,315 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-01-06 11:39:19,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-01-06 11:39:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 11:39:19,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:19,318 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, 1] [2021-01-06 11:39:19,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:39:19,318 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2021-01-06 11:39:19,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:19,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267283935] [2021-01-06 11:39:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:19,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267283935] [2021-01-06 11:39:19,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:19,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:19,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287777604] [2021-01-06 11:39:19,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:19,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:19,480 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2021-01-06 11:39:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:19,848 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2021-01-06 11:39:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:19,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 11:39:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:19,851 INFO L225 Difference]: With dead ends: 280 [2021-01-06 11:39:19,851 INFO L226 Difference]: Without dead ends: 156 [2021-01-06 11:39:19,853 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 [2021-01-06 11:39:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-06 11:39:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-01-06 11:39:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-01-06 11:39:19,862 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2021-01-06 11:39:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:19,862 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-01-06 11:39:19,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-01-06 11:39:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 11:39:19,865 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:19,865 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, 1] [2021-01-06 11:39:19,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:39:19,866 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:19,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2021-01-06 11:39:19,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:19,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079244250] [2021-01-06 11:39:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:19,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079244250] [2021-01-06 11:39:19,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:19,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:19,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896203881] [2021-01-06 11:39:19,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:19,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:19,940 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2021-01-06 11:39:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:20,271 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-01-06 11:39:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:20,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 11:39:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:20,273 INFO L225 Difference]: With dead ends: 280 [2021-01-06 11:39:20,273 INFO L226 Difference]: Without dead ends: 156 [2021-01-06 11:39:20,275 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 [2021-01-06 11:39:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-06 11:39:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-01-06 11:39:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-01-06 11:39:20,294 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2021-01-06 11:39:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:20,297 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-01-06 11:39:20,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-01-06 11:39:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 11:39:20,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:20,303 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, 1] [2021-01-06 11:39:20,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:39:20,304 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2021-01-06 11:39:20,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:20,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651412591] [2021-01-06 11:39:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:20,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651412591] [2021-01-06 11:39:20,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:20,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:20,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553210343] [2021-01-06 11:39:20,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:20,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:20,406 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2021-01-06 11:39:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:20,787 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2021-01-06 11:39:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:20,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 11:39:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:20,790 INFO L225 Difference]: With dead ends: 280 [2021-01-06 11:39:20,790 INFO L226 Difference]: Without dead ends: 156 [2021-01-06 11:39:20,790 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 [2021-01-06 11:39:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-06 11:39:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-01-06 11:39:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-01-06 11:39:20,797 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2021-01-06 11:39:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:20,798 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-01-06 11:39:20,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-01-06 11:39:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 11:39:20,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:20,800 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, 1] [2021-01-06 11:39:20,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:39:20,801 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2021-01-06 11:39:20,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:20,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325076620] [2021-01-06 11:39:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:20,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325076620] [2021-01-06 11:39:20,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:20,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:20,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583523882] [2021-01-06 11:39:20,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:20,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:20,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:20,867 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2021-01-06 11:39:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:21,213 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2021-01-06 11:39:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:21,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 11:39:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:21,215 INFO L225 Difference]: With dead ends: 280 [2021-01-06 11:39:21,216 INFO L226 Difference]: Without dead ends: 156 [2021-01-06 11:39:21,218 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 [2021-01-06 11:39:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-06 11:39:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-01-06 11:39:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:39:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-01-06 11:39:21,225 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2021-01-06 11:39:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-01-06 11:39:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-01-06 11:39:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 11:39:21,227 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:21,228 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] [2021-01-06 11:39:21,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:39:21,228 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2021-01-06 11:39:21,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:21,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460673917] [2021-01-06 11:39:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:21,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460673917] [2021-01-06 11:39:21,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:21,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:21,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672589467] [2021-01-06 11:39:21,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:21,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:21,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:21,359 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2021-01-06 11:39:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:21,718 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2021-01-06 11:39:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:21,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 11:39:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:21,721 INFO L225 Difference]: With dead ends: 310 [2021-01-06 11:39:21,722 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:39:21,722 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 [2021-01-06 11:39:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:39:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-01-06 11:39:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2021-01-06 11:39:21,753 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2021-01-06 11:39:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:21,754 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2021-01-06 11:39:21,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2021-01-06 11:39:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 11:39:21,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:21,756 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, 1] [2021-01-06 11:39:21,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:39:21,756 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2021-01-06 11:39:21,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:21,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894078745] [2021-01-06 11:39:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:21,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894078745] [2021-01-06 11:39:21,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:21,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:21,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913601578] [2021-01-06 11:39:21,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:21,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:21,838 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2021-01-06 11:39:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:22,177 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2021-01-06 11:39:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:22,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-06 11:39:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:22,180 INFO L225 Difference]: With dead ends: 314 [2021-01-06 11:39:22,180 INFO L226 Difference]: Without dead ends: 168 [2021-01-06 11:39:22,181 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 [2021-01-06 11:39:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-06 11:39:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2021-01-06 11:39:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-01-06 11:39:22,188 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2021-01-06 11:39:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:22,189 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-01-06 11:39:22,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-01-06 11:39:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:39:22,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:22,190 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] [2021-01-06 11:39:22,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:39:22,191 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2021-01-06 11:39:22,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:22,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485884571] [2021-01-06 11:39:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:22,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485884571] [2021-01-06 11:39:22,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:22,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:22,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766032614] [2021-01-06 11:39:22,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:22,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:22,261 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2021-01-06 11:39:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:22,620 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2021-01-06 11:39:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:22,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:39:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:22,623 INFO L225 Difference]: With dead ends: 332 [2021-01-06 11:39:22,623 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:39:22,624 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 [2021-01-06 11:39:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:39:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-01-06 11:39:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-01-06 11:39:22,629 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2021-01-06 11:39:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:22,630 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-01-06 11:39:22,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-01-06 11:39:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:39:22,631 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:22,631 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] [2021-01-06 11:39:22,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:39:22,631 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2021-01-06 11:39:22,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:22,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748176629] [2021-01-06 11:39:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:22,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748176629] [2021-01-06 11:39:22,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:22,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:22,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406358746] [2021-01-06 11:39:22,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:22,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:22,697 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2021-01-06 11:39:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:23,071 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2021-01-06 11:39:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:23,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:39:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:23,073 INFO L225 Difference]: With dead ends: 330 [2021-01-06 11:39:23,073 INFO L226 Difference]: Without dead ends: 184 [2021-01-06 11:39:23,074 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 [2021-01-06 11:39:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-01-06 11:39:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2021-01-06 11:39:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-01-06 11:39:23,080 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2021-01-06 11:39:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:23,081 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-01-06 11:39:23,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-01-06 11:39:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:39:23,082 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:23,082 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] [2021-01-06 11:39:23,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:39:23,082 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2021-01-06 11:39:23,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:23,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399279439] [2021-01-06 11:39:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:23,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399279439] [2021-01-06 11:39:23,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:23,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:23,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379490280] [2021-01-06 11:39:23,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:23,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:23,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:23,189 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2021-01-06 11:39:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:23,550 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2021-01-06 11:39:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:23,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:39:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:23,552 INFO L225 Difference]: With dead ends: 329 [2021-01-06 11:39:23,552 INFO L226 Difference]: Without dead ends: 183 [2021-01-06 11:39:23,553 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 [2021-01-06 11:39:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-01-06 11:39:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-01-06 11:39:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-01-06 11:39:23,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2021-01-06 11:39:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:23,560 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-01-06 11:39:23,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-01-06 11:39:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 11:39:23,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:23,561 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, 1] [2021-01-06 11:39:23,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:39:23,561 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2021-01-06 11:39:23,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:23,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789650519] [2021-01-06 11:39:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:23,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789650519] [2021-01-06 11:39:23,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:23,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:23,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122085813] [2021-01-06 11:39:23,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:23,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:23,622 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2021-01-06 11:39:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:23,982 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2021-01-06 11:39:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:23,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 11:39:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:23,983 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:39:23,984 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 11:39:23,984 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 [2021-01-06 11:39:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 11:39:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-01-06 11:39:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-01-06 11:39:23,989 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2021-01-06 11:39:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:23,989 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-01-06 11:39:23,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-01-06 11:39:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 11:39:23,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:23,991 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, 1] [2021-01-06 11:39:23,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:39:23,991 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2021-01-06 11:39:23,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:23,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83022019] [2021-01-06 11:39:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:24,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83022019] [2021-01-06 11:39:24,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:24,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:24,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836074482] [2021-01-06 11:39:24,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:24,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:24,046 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2021-01-06 11:39:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:24,395 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2021-01-06 11:39:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:24,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 11:39:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:24,397 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:39:24,397 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 11:39:24,398 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 [2021-01-06 11:39:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 11:39:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-01-06 11:39:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-01-06 11:39:24,403 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2021-01-06 11:39:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:24,404 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-01-06 11:39:24,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-01-06 11:39:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 11:39:24,405 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:24,405 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, 1] [2021-01-06 11:39:24,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:39:24,405 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2021-01-06 11:39:24,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:24,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925238834] [2021-01-06 11:39:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:24,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925238834] [2021-01-06 11:39:24,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:24,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:24,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146024914] [2021-01-06 11:39:24,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:24,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:24,477 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2021-01-06 11:39:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:24,845 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2021-01-06 11:39:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:24,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 11:39:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:24,846 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:39:24,847 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 11:39:24,847 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 [2021-01-06 11:39:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 11:39:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-01-06 11:39:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-01-06 11:39:24,852 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2021-01-06 11:39:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:24,853 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-01-06 11:39:24,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-01-06 11:39:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 11:39:24,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:24,854 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, 1] [2021-01-06 11:39:24,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:39:24,854 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2021-01-06 11:39:24,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:24,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384535796] [2021-01-06 11:39:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:24,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384535796] [2021-01-06 11:39:24,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:24,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:24,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621518926] [2021-01-06 11:39:24,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:24,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:24,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:24,908 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2021-01-06 11:39:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:25,257 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2021-01-06 11:39:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:25,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 11:39:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:25,259 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:39:25,259 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 11:39:25,260 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 [2021-01-06 11:39:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 11:39:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-01-06 11:39:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-01-06 11:39:25,266 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2021-01-06 11:39:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:25,266 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-01-06 11:39:25,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-01-06 11:39:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 11:39:25,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:25,268 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, 1] [2021-01-06 11:39:25,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:39:25,268 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2021-01-06 11:39:25,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:25,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084068012] [2021-01-06 11:39:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:39:25,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084068012] [2021-01-06 11:39:25,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:25,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:25,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473038733] [2021-01-06 11:39:25,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:25,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:25,339 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2021-01-06 11:39:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:25,673 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2021-01-06 11:39:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:25,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 11:39:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:25,675 INFO L225 Difference]: With dead ends: 318 [2021-01-06 11:39:25,675 INFO L226 Difference]: Without dead ends: 172 [2021-01-06 11:39:25,676 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 [2021-01-06 11:39:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-01-06 11:39:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2021-01-06 11:39:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 11:39:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2021-01-06 11:39:25,681 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2021-01-06 11:39:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:25,681 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2021-01-06 11:39:25,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2021-01-06 11:39:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:39:25,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:25,682 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] [2021-01-06 11:39:25,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:39:25,683 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2021-01-06 11:39:25,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:25,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103892566] [2021-01-06 11:39:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:25,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103892566] [2021-01-06 11:39:25,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:25,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:25,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191705] [2021-01-06 11:39:25,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:25,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:25,833 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2021-01-06 11:39:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:26,386 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2021-01-06 11:39:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:26,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 11:39:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:26,389 INFO L225 Difference]: With dead ends: 408 [2021-01-06 11:39:26,389 INFO L226 Difference]: Without dead ends: 262 [2021-01-06 11:39:26,390 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 [2021-01-06 11:39:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-01-06 11:39:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2021-01-06 11:39:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-06 11:39:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2021-01-06 11:39:26,396 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2021-01-06 11:39:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:26,397 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2021-01-06 11:39:26,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2021-01-06 11:39:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:39:26,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:26,398 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] [2021-01-06 11:39:26,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:39:26,399 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2021-01-06 11:39:26,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:26,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829448432] [2021-01-06 11:39:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:26,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829448432] [2021-01-06 11:39:26,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:26,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:26,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630563382] [2021-01-06 11:39:26,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:26,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:26,474 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2021-01-06 11:39:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:27,009 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2021-01-06 11:39:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:27,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 11:39:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:27,012 INFO L225 Difference]: With dead ends: 446 [2021-01-06 11:39:27,012 INFO L226 Difference]: Without dead ends: 257 [2021-01-06 11:39:27,013 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 [2021-01-06 11:39:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-06 11:39:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-01-06 11:39:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2021-01-06 11:39:27,020 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2021-01-06 11:39:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:27,021 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2021-01-06 11:39:27,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2021-01-06 11:39:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:39:27,022 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:27,022 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] [2021-01-06 11:39:27,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:39:27,023 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2021-01-06 11:39:27,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:27,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292525087] [2021-01-06 11:39:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:27,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292525087] [2021-01-06 11:39:27,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:27,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:27,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117356426] [2021-01-06 11:39:27,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:27,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:27,174 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2021-01-06 11:39:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:27,790 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2021-01-06 11:39:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:27,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:39:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:27,792 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:39:27,792 INFO L226 Difference]: Without dead ends: 286 [2021-01-06 11:39:27,793 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 [2021-01-06 11:39:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-01-06 11:39:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2021-01-06 11:39:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2021-01-06 11:39:27,800 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2021-01-06 11:39:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:27,801 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2021-01-06 11:39:27,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2021-01-06 11:39:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:39:27,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:27,802 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] [2021-01-06 11:39:27,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:39:27,803 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2021-01-06 11:39:27,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:27,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315150449] [2021-01-06 11:39:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:27,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315150449] [2021-01-06 11:39:27,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:27,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:27,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654027372] [2021-01-06 11:39:27,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:27,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:27,873 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2021-01-06 11:39:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:28,304 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2021-01-06 11:39:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:28,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:39:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:28,306 INFO L225 Difference]: With dead ends: 470 [2021-01-06 11:39:28,307 INFO L226 Difference]: Without dead ends: 257 [2021-01-06 11:39:28,307 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 [2021-01-06 11:39:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-06 11:39:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-01-06 11:39:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2021-01-06 11:39:28,314 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2021-01-06 11:39:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:28,315 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2021-01-06 11:39:28,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2021-01-06 11:39:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:39:28,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:28,316 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] [2021-01-06 11:39:28,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:39:28,317 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2021-01-06 11:39:28,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:28,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180964949] [2021-01-06 11:39:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:28,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180964949] [2021-01-06 11:39:28,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:28,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:28,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902672333] [2021-01-06 11:39:28,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:28,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:28,387 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2021-01-06 11:39:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:28,951 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2021-01-06 11:39:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:28,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:39:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:28,954 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:39:28,954 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:39:28,954 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 [2021-01-06 11:39:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:39:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2021-01-06 11:39:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2021-01-06 11:39:28,961 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2021-01-06 11:39:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:28,962 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2021-01-06 11:39:28,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2021-01-06 11:39:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:39:28,963 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:28,963 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] [2021-01-06 11:39:28,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:39:28,963 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2021-01-06 11:39:28,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:28,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292519971] [2021-01-06 11:39:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:29,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292519971] [2021-01-06 11:39:29,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:29,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:29,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557999240] [2021-01-06 11:39:29,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:29,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:29,034 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2021-01-06 11:39:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:29,540 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2021-01-06 11:39:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:29,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:39:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:29,543 INFO L225 Difference]: With dead ends: 496 [2021-01-06 11:39:29,543 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:39:29,543 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 [2021-01-06 11:39:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:39:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2021-01-06 11:39:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2021-01-06 11:39:29,551 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2021-01-06 11:39:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:29,551 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2021-01-06 11:39:29,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2021-01-06 11:39:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:39:29,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:29,553 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] [2021-01-06 11:39:29,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:39:29,553 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2021-01-06 11:39:29,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:29,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112156991] [2021-01-06 11:39:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:29,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112156991] [2021-01-06 11:39:29,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:29,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:29,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018103992] [2021-01-06 11:39:29,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:29,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:29,629 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2021-01-06 11:39:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:30,004 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2021-01-06 11:39:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:30,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:39:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:30,006 INFO L225 Difference]: With dead ends: 468 [2021-01-06 11:39:30,007 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:39:30,007 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 [2021-01-06 11:39:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:39:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2021-01-06 11:39:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2021-01-06 11:39:30,013 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2021-01-06 11:39:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:30,014 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2021-01-06 11:39:30,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2021-01-06 11:39:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:39:30,015 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:30,015 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] [2021-01-06 11:39:30,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:39:30,016 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2021-01-06 11:39:30,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:30,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041312153] [2021-01-06 11:39:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:30,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041312153] [2021-01-06 11:39:30,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:30,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:30,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418601998] [2021-01-06 11:39:30,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:30,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:30,081 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2021-01-06 11:39:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:30,487 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2021-01-06 11:39:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:30,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:39:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:30,489 INFO L225 Difference]: With dead ends: 467 [2021-01-06 11:39:30,489 INFO L226 Difference]: Without dead ends: 254 [2021-01-06 11:39:30,490 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 [2021-01-06 11:39:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-01-06 11:39:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2021-01-06 11:39:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2021-01-06 11:39:30,497 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2021-01-06 11:39:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:30,497 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2021-01-06 11:39:30,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2021-01-06 11:39:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:39:30,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:30,498 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, 1] [2021-01-06 11:39:30,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:39:30,499 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2021-01-06 11:39:30,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:30,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901547679] [2021-01-06 11:39:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:30,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901547679] [2021-01-06 11:39:30,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:30,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:30,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4558419] [2021-01-06 11:39:30,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:30,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:30,565 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2021-01-06 11:39:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:31,070 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2021-01-06 11:39:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:31,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:39:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:31,073 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:39:31,073 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:39:31,074 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 [2021-01-06 11:39:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:39:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2021-01-06 11:39:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-06 11:39:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2021-01-06 11:39:31,081 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2021-01-06 11:39:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:31,081 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2021-01-06 11:39:31,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2021-01-06 11:39:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:39:31,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:31,083 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] [2021-01-06 11:39:31,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:39:31,083 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2021-01-06 11:39:31,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:31,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120752908] [2021-01-06 11:39:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:39:31,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120752908] [2021-01-06 11:39:31,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:31,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:39:31,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438287626] [2021-01-06 11:39:31,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:39:31,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:39:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:39:31,173 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2021-01-06 11:39:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:31,696 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2021-01-06 11:39:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:39:31,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2021-01-06 11:39:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:31,698 INFO L225 Difference]: With dead ends: 466 [2021-01-06 11:39:31,699 INFO L226 Difference]: Without dead ends: 253 [2021-01-06 11:39:31,699 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 [2021-01-06 11:39:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-01-06 11:39:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-01-06 11:39:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2021-01-06 11:39:31,707 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2021-01-06 11:39:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:31,707 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2021-01-06 11:39:31,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:39:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2021-01-06 11:39:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:39:31,708 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:31,709 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, 1] [2021-01-06 11:39:31,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:39:31,709 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2021-01-06 11:39:31,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:31,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317232093] [2021-01-06 11:39:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:31,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317232093] [2021-01-06 11:39:31,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:31,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:31,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182051317] [2021-01-06 11:39:31,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:31,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:31,811 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2021-01-06 11:39:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:32,334 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2021-01-06 11:39:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:32,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:39:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:32,337 INFO L225 Difference]: With dead ends: 535 [2021-01-06 11:39:32,337 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:39:32,338 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 [2021-01-06 11:39:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:39:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-01-06 11:39:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2021-01-06 11:39:32,350 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2021-01-06 11:39:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:32,350 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2021-01-06 11:39:32,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2021-01-06 11:39:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:39:32,352 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:32,352 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, 1] [2021-01-06 11:39:32,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:39:32,352 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2021-01-06 11:39:32,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:32,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869635526] [2021-01-06 11:39:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:32,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869635526] [2021-01-06 11:39:32,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:32,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:32,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091161727] [2021-01-06 11:39:32,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:32,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:32,438 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2021-01-06 11:39:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:32,836 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2021-01-06 11:39:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:32,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:39:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:32,839 INFO L225 Difference]: With dead ends: 506 [2021-01-06 11:39:32,839 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:39:32,840 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 [2021-01-06 11:39:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:39:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-01-06 11:39:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2021-01-06 11:39:32,849 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2021-01-06 11:39:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:32,849 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2021-01-06 11:39:32,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2021-01-06 11:39:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:39:32,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:32,851 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, 1] [2021-01-06 11:39:32,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:39:32,852 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2021-01-06 11:39:32,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:32,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814030341] [2021-01-06 11:39:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:32,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814030341] [2021-01-06 11:39:32,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:32,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:32,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587518126] [2021-01-06 11:39:32,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:32,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:32,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:32,921 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2021-01-06 11:39:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:33,476 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2021-01-06 11:39:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:33,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2021-01-06 11:39:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:33,480 INFO L225 Difference]: With dead ends: 535 [2021-01-06 11:39:33,480 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:39:33,481 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 [2021-01-06 11:39:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:39:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-01-06 11:39:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2021-01-06 11:39:33,491 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2021-01-06 11:39:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:33,491 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2021-01-06 11:39:33,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2021-01-06 11:39:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:39:33,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:33,493 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, 1] [2021-01-06 11:39:33,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:39:33,494 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:33,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2021-01-06 11:39:33,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:33,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533062985] [2021-01-06 11:39:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:33,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533062985] [2021-01-06 11:39:33,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:33,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:33,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356165019] [2021-01-06 11:39:33,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:33,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:33,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:33,573 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2021-01-06 11:39:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:33,983 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2021-01-06 11:39:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:33,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2021-01-06 11:39:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:33,986 INFO L225 Difference]: With dead ends: 506 [2021-01-06 11:39:33,986 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:39:33,987 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 [2021-01-06 11:39:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:39:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-01-06 11:39:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2021-01-06 11:39:33,995 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2021-01-06 11:39:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:33,996 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2021-01-06 11:39:33,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2021-01-06 11:39:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 11:39:33,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:33,997 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, 1] [2021-01-06 11:39:33,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:39:33,997 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2021-01-06 11:39:33,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:33,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605400472] [2021-01-06 11:39:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:34,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605400472] [2021-01-06 11:39:34,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:34,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:34,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374565133] [2021-01-06 11:39:34,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:34,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:34,067 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2021-01-06 11:39:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:34,574 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2021-01-06 11:39:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:34,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 11:39:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:34,577 INFO L225 Difference]: With dead ends: 535 [2021-01-06 11:39:34,578 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:39:34,578 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 [2021-01-06 11:39:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:39:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-01-06 11:39:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2021-01-06 11:39:34,587 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2021-01-06 11:39:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:34,587 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2021-01-06 11:39:34,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2021-01-06 11:39:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 11:39:34,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:34,589 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, 1] [2021-01-06 11:39:34,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:39:34,589 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2021-01-06 11:39:34,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:34,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457006728] [2021-01-06 11:39:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:34,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457006728] [2021-01-06 11:39:34,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:34,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:34,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489329780] [2021-01-06 11:39:34,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:34,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:34,656 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2021-01-06 11:39:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:35,042 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2021-01-06 11:39:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:35,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 11:39:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:35,046 INFO L225 Difference]: With dead ends: 506 [2021-01-06 11:39:35,046 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:39:35,047 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 [2021-01-06 11:39:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:39:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-01-06 11:39:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2021-01-06 11:39:35,054 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2021-01-06 11:39:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:35,055 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2021-01-06 11:39:35,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2021-01-06 11:39:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 11:39:35,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:35,056 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, 1] [2021-01-06 11:39:35,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:39:35,056 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:35,057 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2021-01-06 11:39:35,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:35,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711165543] [2021-01-06 11:39:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:35,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711165543] [2021-01-06 11:39:35,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:35,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:35,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367465244] [2021-01-06 11:39:35,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:35,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:35,153 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2021-01-06 11:39:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:35,628 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2021-01-06 11:39:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:35,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-06 11:39:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:35,631 INFO L225 Difference]: With dead ends: 525 [2021-01-06 11:39:35,632 INFO L226 Difference]: Without dead ends: 292 [2021-01-06 11:39:35,632 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 [2021-01-06 11:39:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-01-06 11:39:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2021-01-06 11:39:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2021-01-06 11:39:35,642 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2021-01-06 11:39:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:35,642 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2021-01-06 11:39:35,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2021-01-06 11:39:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 11:39:35,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:35,644 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, 1] [2021-01-06 11:39:35,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:39:35,644 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2021-01-06 11:39:35,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:35,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59657731] [2021-01-06 11:39:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:35,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59657731] [2021-01-06 11:39:35,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:35,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:35,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052884755] [2021-01-06 11:39:35,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:35,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:35,712 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2021-01-06 11:39:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:36,117 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2021-01-06 11:39:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:36,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-06 11:39:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:36,119 INFO L225 Difference]: With dead ends: 496 [2021-01-06 11:39:36,119 INFO L226 Difference]: Without dead ends: 263 [2021-01-06 11:39:36,120 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 [2021-01-06 11:39:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-01-06 11:39:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2021-01-06 11:39:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2021-01-06 11:39:36,132 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2021-01-06 11:39:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:36,133 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2021-01-06 11:39:36,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2021-01-06 11:39:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:39:36,135 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:36,135 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] [2021-01-06 11:39:36,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:39:36,136 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2021-01-06 11:39:36,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:36,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332101806] [2021-01-06 11:39:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:39:36,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332101806] [2021-01-06 11:39:36,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:36,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:36,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664992583] [2021-01-06 11:39:36,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:36,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:36,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:36,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:36,229 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2021-01-06 11:39:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:36,761 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2021-01-06 11:39:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:36,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-06 11:39:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:36,764 INFO L225 Difference]: With dead ends: 525 [2021-01-06 11:39:36,765 INFO L226 Difference]: Without dead ends: 292 [2021-01-06 11:39:36,765 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 [2021-01-06 11:39:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-01-06 11:39:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2021-01-06 11:39:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-01-06 11:39:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2021-01-06 11:39:36,774 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2021-01-06 11:39:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:36,774 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2021-01-06 11:39:36,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2021-01-06 11:39:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:39:36,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:36,776 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] [2021-01-06 11:39:36,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:39:36,776 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2021-01-06 11:39:36,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:36,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820881730] [2021-01-06 11:39:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:39:36,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820881730] [2021-01-06 11:39:36,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:36,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:36,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399993357] [2021-01-06 11:39:36,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:36,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:36,870 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2021-01-06 11:39:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:36,931 INFO L93 Difference]: Finished difference Result 714 states and 1066 transitions. [2021-01-06 11:39:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:36,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:39:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:36,934 INFO L225 Difference]: With dead ends: 714 [2021-01-06 11:39:36,934 INFO L226 Difference]: Without dead ends: 481 [2021-01-06 11:39:36,935 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 [2021-01-06 11:39:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-01-06 11:39:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2021-01-06 11:39:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2021-01-06 11:39:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 711 transitions. [2021-01-06 11:39:36,950 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 711 transitions. Word has length 106 [2021-01-06 11:39:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:36,950 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 711 transitions. [2021-01-06 11:39:36,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 711 transitions. [2021-01-06 11:39:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:39:36,952 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:36,952 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] [2021-01-06 11:39:36,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:39:36,952 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash 888288017, now seen corresponding path program 1 times [2021-01-06 11:39:36,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:36,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989516709] [2021-01-06 11:39:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:39:37,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989516709] [2021-01-06 11:39:37,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:37,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:37,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014285895] [2021-01-06 11:39:37,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:37,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:37,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:37,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:37,012 INFO L87 Difference]: Start difference. First operand 481 states and 711 transitions. Second operand 3 states. [2021-01-06 11:39:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:37,085 INFO L93 Difference]: Finished difference Result 970 states and 1437 transitions. [2021-01-06 11:39:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:37,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:39:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:37,089 INFO L225 Difference]: With dead ends: 970 [2021-01-06 11:39:37,089 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 11:39:37,090 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 [2021-01-06 11:39:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 11:39:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-01-06 11:39:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2021-01-06 11:39:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 746 transitions. [2021-01-06 11:39:37,106 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 746 transitions. Word has length 106 [2021-01-06 11:39:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:37,106 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 746 transitions. [2021-01-06 11:39:37,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 746 transitions. [2021-01-06 11:39:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:39:37,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:37,108 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] [2021-01-06 11:39:37,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:39:37,108 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 302011795, now seen corresponding path program 1 times [2021-01-06 11:39:37,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:37,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138122452] [2021-01-06 11:39:37,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:39:37,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138122452] [2021-01-06 11:39:37,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:37,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:37,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11047206] [2021-01-06 11:39:37,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:37,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:37,155 INFO L87 Difference]: Start difference. First operand 508 states and 746 transitions. Second operand 3 states. [2021-01-06 11:39:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:37,181 INFO L93 Difference]: Finished difference Result 999 states and 1473 transitions. [2021-01-06 11:39:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:37,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:39:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:37,184 INFO L225 Difference]: With dead ends: 999 [2021-01-06 11:39:37,184 INFO L226 Difference]: Without dead ends: 510 [2021-01-06 11:39:37,185 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 [2021-01-06 11:39:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-01-06 11:39:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-01-06 11:39:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2021-01-06 11:39:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 748 transitions. [2021-01-06 11:39:37,200 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 748 transitions. Word has length 106 [2021-01-06 11:39:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:37,200 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 748 transitions. [2021-01-06 11:39:37,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 748 transitions. [2021-01-06 11:39:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-06 11:39:37,202 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:37,202 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] [2021-01-06 11:39:37,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:39:37,203 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2021-01-06 11:39:37,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:37,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847561649] [2021-01-06 11:39:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:39:37,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847561649] [2021-01-06 11:39:37,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:37,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:37,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063987836] [2021-01-06 11:39:37,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:37,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:37,286 INFO L87 Difference]: Start difference. First operand 510 states and 748 transitions. Second operand 3 states. [2021-01-06 11:39:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:37,361 INFO L93 Difference]: Finished difference Result 999 states and 1472 transitions. [2021-01-06 11:39:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:37,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2021-01-06 11:39:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:37,365 INFO L225 Difference]: With dead ends: 999 [2021-01-06 11:39:37,365 INFO L226 Difference]: Without dead ends: 510 [2021-01-06 11:39:37,366 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 [2021-01-06 11:39:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-01-06 11:39:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-01-06 11:39:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2021-01-06 11:39:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 743 transitions. [2021-01-06 11:39:37,383 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 743 transitions. Word has length 125 [2021-01-06 11:39:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:37,383 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 743 transitions. [2021-01-06 11:39:37,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 743 transitions. [2021-01-06 11:39:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-01-06 11:39:37,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:37,385 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, 1] [2021-01-06 11:39:37,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:39:37,385 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2021-01-06 11:39:37,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:37,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61752391] [2021-01-06 11:39:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:39:37,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:39:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:39:37,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:39:37,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:39:37,754 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:39:37,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:39:37,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:39:37 BoogieIcfgContainer [2021-01-06 11:39:37,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:39:37,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:39:37,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:39:37,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:39:37,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:16" (3/4) ... [2021-01-06 11:39:37,966 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:39:37,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:39:37,968 INFO L168 Benchmark]: Toolchain (without parser) took 24540.34 ms. Allocated memory was 160.4 MB in the beginning and 400.6 MB in the end (delta: 240.1 MB). Free memory was 133.6 MB in the beginning and 162.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 211.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,969 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 160.4 MB. Free memory is still 132.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:39:37,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 972.00 ms. Allocated memory is still 160.4 MB. Free memory was 133.3 MB in the beginning and 136.1 MB in the end (delta: -2.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.75 ms. Allocated memory is still 160.4 MB. Free memory was 136.1 MB in the beginning and 131.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,970 INFO L168 Benchmark]: Boogie Preprocessor took 86.58 ms. Allocated memory is still 160.4 MB. Free memory was 131.4 MB in the beginning and 124.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,970 INFO L168 Benchmark]: RCFGBuilder took 1516.71 ms. Allocated memory was 160.4 MB in the beginning and 223.3 MB in the end (delta: 62.9 MB). Free memory was 124.6 MB in the beginning and 183.9 MB in the end (delta: -59.2 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,971 INFO L168 Benchmark]: TraceAbstraction took 21844.27 ms. Allocated memory was 223.3 MB in the beginning and 400.6 MB in the end (delta: 177.2 MB). Free memory was 183.3 MB in the beginning and 163.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:37,971 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 400.6 MB. Free memory was 163.0 MB in the beginning and 162.5 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:39:37,973 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.20 ms. Allocated memory is still 160.4 MB. Free memory is still 132.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 972.00 ms. Allocated memory is still 160.4 MB. Free memory was 133.3 MB in the beginning and 136.1 MB in the end (delta: -2.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.75 ms. Allocated memory is still 160.4 MB. Free memory was 136.1 MB in the beginning and 131.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 86.58 ms. Allocated memory is still 160.4 MB. Free memory was 131.4 MB in the beginning and 124.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1516.71 ms. Allocated memory was 160.4 MB in the beginning and 223.3 MB in the end (delta: 62.9 MB). Free memory was 124.6 MB in the beginning and 183.9 MB in the end (delta: -59.2 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21844.27 ms. Allocated memory was 223.3 MB in the beginning and 400.6 MB in the end (delta: 177.2 MB). Free memory was 183.3 MB in the beginning and 163.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 8.0 GB. * Witness Printer took 4.89 ms. Allocated memory is still 400.6 MB. Free memory was 163.0 MB in the beginning and 162.5 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1708]: 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 1122. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1097] int tmp___4 ; [L1098] int tmp___5 ; [L1099] int tmp___6 ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 ; [L1103] int tmp___10 ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] Time = tmp [L1112] cb = (void (*)())((void *)0) [L1113] ret = -1 [L1114] skip = 0 [L1115] got_new_session = 0 [L1116] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1116] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1117] EXPR s->info_callback [L1117] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1131] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1131] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND TRUE s->state == 8464 [L1320] s->shutdown = 0 [L1321] ret = __VERIFIER_nondet_int() [L1322] COND TRUE blastFlag == 0 [L1323] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1327] COND FALSE !(ret <= 0) [L1332] got_new_session = 1 [L1333] s->state = 8496 [L1334] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND TRUE s->state == 8496 [L1338] ret = __VERIFIER_nondet_int() [L1339] COND TRUE blastFlag == 1 [L1340] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1344] COND FALSE !(ret <= 0) [L1349] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND TRUE s->hit [L1350] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1354] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1230] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] tmp___9 = __VERIFIER_nondet_int() [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 5 VAL [init=1, SSLv3_server_data={6:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 [L1575] tmp___10 = __VERIFIER_nondet_int() [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1230] COND FALSE !(s->state == 8656) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1233] COND FALSE !(s->state == 8657) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1236] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={6:0}] [L1589] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={6:0}] [L1708] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.5s, OverallIterations: 42, TraceHistogramMax: 4, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8012 SDtfs, 2270 SDslu, 11389 SDs, 0 SdLazy, 6913 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 82 SyntacticMatches, 29 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred 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, 41 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3646 NumberOfCodeBlocks, 3646 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3479 ConstructedInterpolants, 0 QuantifiedInterpolants, 795476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 1839/1839 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...