/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_clnt.blast.04.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:38:50,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:38:50,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:38:50,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:38:50,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:38:50,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:38:50,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:38:50,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:38:50,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:38:50,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:38:50,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:38:50,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:38:50,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:38:50,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:38:50,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:38:50,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:38:50,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:38:50,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:38:50,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:38:50,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:38:50,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:38:50,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:38:50,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:38:50,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:38:50,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:38:50,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:38:50,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:38:50,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:38:50,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:38:50,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:38:50,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:38:50,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:38:50,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:38:50,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:38:50,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:38:50,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:38:50,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:38:50,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:38:50,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:38:50,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:38:50,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:38:50,522 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:38:50,564 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:38:50,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:38:50,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:38:50,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:38:50,568 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:38:50,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:38:50,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:38:50,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:38:50,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:38:50,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:38:50,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:38:50,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:38:50,571 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:38:50,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:38:50,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:38:50,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:38:50,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:38:50,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:38:50,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:38:50,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:38:50,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:38:50,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:38:50,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:38:50,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:38:50,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:38:50,574 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:38:50,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:38:50,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:38:50,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:38:50,983 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:38:50,983 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:38:50,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2021-01-06 11:38:51,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c6d2b50da/be2b866d76f94ea09327bbe544284807/FLAG11f3b2cd5 [2021-01-06 11:38:51,803 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:38:51,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2021-01-06 11:38:51,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c6d2b50da/be2b866d76f94ea09327bbe544284807/FLAG11f3b2cd5 [2021-01-06 11:38:52,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c6d2b50da/be2b866d76f94ea09327bbe544284807 [2021-01-06 11:38:52,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:38:52,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:38:52,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:52,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:38:52,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:38:52,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:52,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7916fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52, skipping insertion in model container [2021-01-06 11:38:52,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:52,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:38:52,134 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[~init~0,GLOBAL] 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_client_data~0,GLOBAL],ssl_connect] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_client_data~0,GLOBAL],get_ssl_method] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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[~cb~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[72],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: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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: 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: 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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: 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[~l~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[#t~mem96,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem96,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem98,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem98,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem100,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem100,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem105,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem105,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem106,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem106,],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: 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~mem114,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem114,],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~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~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: 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: lhs: VariableLHS[~ret~0,] 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[~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:38:52,681 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_clnt.blast.04.i.cil-1.c[64361,64374] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:52,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:52,722 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] 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_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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[~cb~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[72],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: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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: 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: 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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: 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[~l~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[#t~mem96,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem96,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem98,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem98,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem100,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem100,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem105,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem105,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem106,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem106,],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: 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~mem114,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem114,],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~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~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: 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: lhs: VariableLHS[~ret~0,] 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[~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:38:52,885 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_clnt.blast.04.i.cil-1.c[64361,64374] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:52,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:52,953 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:38:52,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52 WrapperNode [2021-01-06 11:38:52,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:52,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:52,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:38:52,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:38:52,978 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:38:52" (1/1) ... [2021-01-06 11:38:53,008 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:38:52" (1/1) ... [2021-01-06 11:38:53,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:53,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:38:53,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:38:53,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:38:53,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (1/1) ... [2021-01-06 11:38:53,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:38:53,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:38:53,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:38:53,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:38:53,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (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:38:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:38:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:38:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:38:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:38:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:38:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:38:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:38:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:38:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:38:53,590 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:38:54,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-06 11:38:54,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-06 11:38:54,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:38:54,427 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:38:54,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:54 BoogieIcfgContainer [2021-01-06 11:38:54,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:38:54,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:38:54,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:38:54,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:38:54,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:38:52" (1/3) ... [2021-01-06 11:38:54,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45480ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:54, skipping insertion in model container [2021-01-06 11:38:54,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:52" (2/3) ... [2021-01-06 11:38:54,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45480ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:54, skipping insertion in model container [2021-01-06 11:38:54,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:54" (3/3) ... [2021-01-06 11:38:54,439 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2021-01-06 11:38:54,446 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:38:54,452 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:38:54,472 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:38:54,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:38:54,500 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:38:54,500 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:38:54,500 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:38:54,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:38:54,501 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:38:54,501 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:38:54,501 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:38:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2021-01-06 11:38:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:38:54,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:54,527 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] [2021-01-06 11:38:54,527 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-01-06 11:38:54,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:54,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931559024] [2021-01-06 11:38:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:54,845 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:38:54,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931559024] [2021-01-06 11:38:54,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:54,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:54,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856447000] [2021-01-06 11:38:54,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:54,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:54,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:54,871 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2021-01-06 11:38:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:55,342 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2021-01-06 11:38:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:55,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-06 11:38:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:55,359 INFO L225 Difference]: With dead ends: 255 [2021-01-06 11:38:55,359 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 11:38:55,364 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:38:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 11:38:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-01-06 11:38:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-06 11:38:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-01-06 11:38:55,474 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-01-06 11:38:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:55,475 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-01-06 11:38:55,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-01-06 11:38:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 11:38:55,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:55,481 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] [2021-01-06 11:38:55,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:38:55,482 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2021-01-06 11:38:55,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:55,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317483290] [2021-01-06 11:38:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:55,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317483290] [2021-01-06 11:38:55,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:55,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:55,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81628121] [2021-01-06 11:38:55,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:55,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:55,709 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2021-01-06 11:38:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:55,779 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2021-01-06 11:38:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:55,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 11:38:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:55,783 INFO L225 Difference]: With dead ends: 321 [2021-01-06 11:38:55,783 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 11:38:55,785 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:38:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 11:38:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-01-06 11:38:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 11:38:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2021-01-06 11:38:55,813 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2021-01-06 11:38:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:55,813 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2021-01-06 11:38:55,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2021-01-06 11:38:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 11:38:55,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:55,816 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 11:38:55,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:38:55,817 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2021-01-06 11:38:55,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:55,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198978429] [2021-01-06 11:38:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:55,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198978429] [2021-01-06 11:38:55,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:55,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:55,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418127123] [2021-01-06 11:38:55,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:55,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:55,966 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2021-01-06 11:38:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:56,127 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2021-01-06 11:38:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:56,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 11:38:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:56,135 INFO L225 Difference]: With dead ends: 421 [2021-01-06 11:38:56,136 INFO L226 Difference]: Without dead ends: 316 [2021-01-06 11:38:56,137 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:38:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-06 11:38:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-01-06 11:38:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2021-01-06 11:38:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2021-01-06 11:38:56,167 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2021-01-06 11:38:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:56,168 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2021-01-06 11:38:56,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2021-01-06 11:38:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 11:38:56,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:56,173 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:56,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:38:56,173 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2021-01-06 11:38:56,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:56,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532241622] [2021-01-06 11:38:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:56,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532241622] [2021-01-06 11:38:56,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:56,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:56,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979084023] [2021-01-06 11:38:56,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:56,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:56,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:56,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:56,322 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand 4 states. [2021-01-06 11:38:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:56,972 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2021-01-06 11:38:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:56,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 11:38:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:56,976 INFO L225 Difference]: With dead ends: 808 [2021-01-06 11:38:56,976 INFO L226 Difference]: Without dead ends: 502 [2021-01-06 11:38:56,979 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:38:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-01-06 11:38:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 366. [2021-01-06 11:38:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2021-01-06 11:38:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 553 transitions. [2021-01-06 11:38:57,013 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 553 transitions. Word has length 71 [2021-01-06 11:38:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:57,014 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 553 transitions. [2021-01-06 11:38:57,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 553 transitions. [2021-01-06 11:38:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 11:38:57,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:57,019 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:38:57,019 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1105291701, now seen corresponding path program 1 times [2021-01-06 11:38:57,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:57,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236045772] [2021-01-06 11:38:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:57,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236045772] [2021-01-06 11:38:57,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:57,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:57,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955107850] [2021-01-06 11:38:57,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:57,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:57,132 INFO L87 Difference]: Start difference. First operand 366 states and 553 transitions. Second operand 4 states. [2021-01-06 11:38:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:57,540 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2021-01-06 11:38:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:57,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 11:38:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:57,544 INFO L225 Difference]: With dead ends: 808 [2021-01-06 11:38:57,545 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:38:57,546 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:38:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:38:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2021-01-06 11:38:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2021-01-06 11:38:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 621 transitions. [2021-01-06 11:38:57,576 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 621 transitions. Word has length 71 [2021-01-06 11:38:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:57,576 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 621 transitions. [2021-01-06 11:38:57,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2021-01-06 11:38:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:38:57,584 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:57,584 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:57,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:38:57,588 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2021-01-06 11:38:57,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:57,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567785010] [2021-01-06 11:38:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:57,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567785010] [2021-01-06 11:38:57,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:57,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:57,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615549588] [2021-01-06 11:38:57,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:57,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:57,742 INFO L87 Difference]: Start difference. First operand 406 states and 621 transitions. Second operand 4 states. [2021-01-06 11:38:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:58,401 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2021-01-06 11:38:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:58,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 11:38:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:58,411 INFO L225 Difference]: With dead ends: 930 [2021-01-06 11:38:58,411 INFO L226 Difference]: Without dead ends: 534 [2021-01-06 11:38:58,412 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:38:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-01-06 11:38:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 408. [2021-01-06 11:38:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:38:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2021-01-06 11:38:58,434 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 72 [2021-01-06 11:38:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:58,436 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2021-01-06 11:38:58,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2021-01-06 11:38:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:58,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:58,442 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:58,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:38:58,450 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -200583067, now seen corresponding path program 2 times [2021-01-06 11:38:58,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:58,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720971220] [2021-01-06 11:38:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:58,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720971220] [2021-01-06 11:38:58,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:58,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:58,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033867706] [2021-01-06 11:38:58,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:58,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:58,666 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2021-01-06 11:38:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:59,294 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2021-01-06 11:38:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:59,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:38:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:59,298 INFO L225 Difference]: With dead ends: 930 [2021-01-06 11:38:59,299 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:59,300 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:38:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2021-01-06 11:38:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:38:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 621 transitions. [2021-01-06 11:38:59,319 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 621 transitions. Word has length 85 [2021-01-06 11:38:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:59,319 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 621 transitions. [2021-01-06 11:38:59,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 621 transitions. [2021-01-06 11:38:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:59,325 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:59,325 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2021-01-06 11:38:59,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:38:59,326 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1309563513, now seen corresponding path program 1 times [2021-01-06 11:38:59,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:59,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223295562] [2021-01-06 11:38:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:59,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223295562] [2021-01-06 11:38:59,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:59,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:59,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614535567] [2021-01-06 11:38:59,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:59,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:59,453 INFO L87 Difference]: Start difference. First operand 408 states and 621 transitions. Second operand 4 states. [2021-01-06 11:39:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:00,091 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2021-01-06 11:39:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:00,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:39:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:00,096 INFO L225 Difference]: With dead ends: 930 [2021-01-06 11:39:00,096 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:39:00,098 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:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:39:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2021-01-06 11:39:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 619 transitions. [2021-01-06 11:39:00,118 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 619 transitions. Word has length 85 [2021-01-06 11:39:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:00,119 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 619 transitions. [2021-01-06 11:39:00,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 619 transitions. [2021-01-06 11:39:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:39:00,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:00,123 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:39:00,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:39:00,124 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1229942365, now seen corresponding path program 2 times [2021-01-06 11:39:00,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:00,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449071287] [2021-01-06 11:39:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:00,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449071287] [2021-01-06 11:39:00,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:00,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:00,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486745391] [2021-01-06 11:39:00,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:00,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:00,271 INFO L87 Difference]: Start difference. First operand 408 states and 619 transitions. Second operand 4 states. [2021-01-06 11:39:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:00,764 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2021-01-06 11:39:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:00,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:39:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:00,768 INFO L225 Difference]: With dead ends: 850 [2021-01-06 11:39:00,768 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:39:00,769 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:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:39:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2021-01-06 11:39:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 617 transitions. [2021-01-06 11:39:00,785 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 617 transitions. Word has length 85 [2021-01-06 11:39:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:00,785 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 617 transitions. [2021-01-06 11:39:00,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 617 transitions. [2021-01-06 11:39:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:39:00,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:00,787 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2021-01-06 11:39:00,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:39:00,788 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044485, now seen corresponding path program 1 times [2021-01-06 11:39:00,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:00,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234961224] [2021-01-06 11:39:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:00,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234961224] [2021-01-06 11:39:00,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:00,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:00,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211634715] [2021-01-06 11:39:00,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:00,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:00,877 INFO L87 Difference]: Start difference. First operand 408 states and 617 transitions. Second operand 4 states. [2021-01-06 11:39:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:01,327 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2021-01-06 11:39:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:01,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:39:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:01,330 INFO L225 Difference]: With dead ends: 850 [2021-01-06 11:39:01,330 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:39:01,331 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:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:39:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2021-01-06 11:39:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 615 transitions. [2021-01-06 11:39:01,345 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 615 transitions. Word has length 85 [2021-01-06 11:39:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:01,345 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 615 transitions. [2021-01-06 11:39:01,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 615 transitions. [2021-01-06 11:39:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:39:01,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:01,347 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:01,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:39:01,347 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1887370232, now seen corresponding path program 1 times [2021-01-06 11:39:01,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:01,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750320437] [2021-01-06 11:39:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:01,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750320437] [2021-01-06 11:39:01,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:01,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:01,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643622874] [2021-01-06 11:39:01,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:01,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:01,427 INFO L87 Difference]: Start difference. First operand 408 states and 615 transitions. Second operand 4 states. [2021-01-06 11:39:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:02,066 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2021-01-06 11:39:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:02,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:39:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:02,069 INFO L225 Difference]: With dead ends: 930 [2021-01-06 11:39:02,070 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:39:02,071 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:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:39:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2021-01-06 11:39:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2021-01-06 11:39:02,084 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 86 [2021-01-06 11:39:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:02,085 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2021-01-06 11:39:02,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2021-01-06 11:39:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:39:02,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:02,087 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:02,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:39:02,087 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1587309149, now seen corresponding path program 1 times [2021-01-06 11:39:02,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:02,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815753918] [2021-01-06 11:39:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:02,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815753918] [2021-01-06 11:39:02,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:02,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:02,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605746481] [2021-01-06 11:39:02,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:02,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:02,168 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand 4 states. [2021-01-06 11:39:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:02,697 INFO L93 Difference]: Finished difference Result 785 states and 1170 transitions. [2021-01-06 11:39:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:02,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:39:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:02,701 INFO L225 Difference]: With dead ends: 785 [2021-01-06 11:39:02,701 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:39:02,702 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:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:39:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2021-01-06 11:39:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 611 transitions. [2021-01-06 11:39:02,716 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 611 transitions. Word has length 86 [2021-01-06 11:39:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:02,717 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 611 transitions. [2021-01-06 11:39:02,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 611 transitions. [2021-01-06 11:39:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:39:02,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:02,718 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:02,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:39:02,719 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 562229898, now seen corresponding path program 1 times [2021-01-06 11:39:02,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:02,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004551355] [2021-01-06 11:39:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:02,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004551355] [2021-01-06 11:39:02,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:02,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:02,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256041480] [2021-01-06 11:39:02,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:02,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:02,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:02,798 INFO L87 Difference]: Start difference. First operand 408 states and 611 transitions. Second operand 4 states. [2021-01-06 11:39:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:03,217 INFO L93 Difference]: Finished difference Result 850 states and 1264 transitions. [2021-01-06 11:39:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:03,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:39:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:03,220 INFO L225 Difference]: With dead ends: 850 [2021-01-06 11:39:03,220 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:39:03,221 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:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:39:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2021-01-06 11:39:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 609 transitions. [2021-01-06 11:39:03,234 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 609 transitions. Word has length 86 [2021-01-06 11:39:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:03,235 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 609 transitions. [2021-01-06 11:39:03,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 609 transitions. [2021-01-06 11:39:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:39:03,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:03,237 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:03,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:39:03,237 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:03,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:03,238 INFO L82 PathProgramCache]: Analyzing trace with hash 862290981, now seen corresponding path program 1 times [2021-01-06 11:39:03,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:03,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297954389] [2021-01-06 11:39:03,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:03,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297954389] [2021-01-06 11:39:03,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:03,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:03,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015690290] [2021-01-06 11:39:03,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:03,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:03,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:03,331 INFO L87 Difference]: Start difference. First operand 408 states and 609 transitions. Second operand 4 states. [2021-01-06 11:39:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:03,731 INFO L93 Difference]: Finished difference Result 705 states and 1043 transitions. [2021-01-06 11:39:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:03,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:39:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:03,734 INFO L225 Difference]: With dead ends: 705 [2021-01-06 11:39:03,734 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:39:03,735 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:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:39:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2021-01-06 11:39:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2021-01-06 11:39:03,749 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 86 [2021-01-06 11:39:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:03,750 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2021-01-06 11:39:03,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2021-01-06 11:39:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:39:03,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:03,752 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:03,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:39:03,752 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1732038594, now seen corresponding path program 1 times [2021-01-06 11:39:03,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:03,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464955237] [2021-01-06 11:39:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:03,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464955237] [2021-01-06 11:39:03,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:03,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:03,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589225322] [2021-01-06 11:39:03,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:03,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:03,834 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 4 states. [2021-01-06 11:39:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:04,432 INFO L93 Difference]: Finished difference Result 930 states and 1377 transitions. [2021-01-06 11:39:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:04,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:39:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:04,436 INFO L225 Difference]: With dead ends: 930 [2021-01-06 11:39:04,436 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:39:04,437 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:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:39:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2021-01-06 11:39:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2021-01-06 11:39:04,451 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 87 [2021-01-06 11:39:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:04,451 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2021-01-06 11:39:04,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2021-01-06 11:39:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:39:04,453 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:04,453 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:04,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:39:04,454 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 442060930, now seen corresponding path program 1 times [2021-01-06 11:39:04,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:04,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959302078] [2021-01-06 11:39:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:04,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959302078] [2021-01-06 11:39:04,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:04,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:04,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033741079] [2021-01-06 11:39:04,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:04,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:04,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:04,536 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand 4 states. [2021-01-06 11:39:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:05,056 INFO L93 Difference]: Finished difference Result 779 states and 1151 transitions. [2021-01-06 11:39:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:05,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:39:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:05,060 INFO L225 Difference]: With dead ends: 779 [2021-01-06 11:39:05,060 INFO L226 Difference]: Without dead ends: 526 [2021-01-06 11:39:05,061 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:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-01-06 11:39:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 408. [2021-01-06 11:39:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 603 transitions. [2021-01-06 11:39:05,074 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 603 transitions. Word has length 87 [2021-01-06 11:39:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:05,074 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 603 transitions. [2021-01-06 11:39:05,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 603 transitions. [2021-01-06 11:39:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:39:05,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:05,076 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:05,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:39:05,076 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 360231296, now seen corresponding path program 1 times [2021-01-06 11:39:05,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:05,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595506160] [2021-01-06 11:39:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:05,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595506160] [2021-01-06 11:39:05,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:05,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:05,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811674336] [2021-01-06 11:39:05,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:05,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:05,150 INFO L87 Difference]: Start difference. First operand 408 states and 603 transitions. Second operand 4 states. [2021-01-06 11:39:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:05,605 INFO L93 Difference]: Finished difference Result 850 states and 1248 transitions. [2021-01-06 11:39:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:05,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:39:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:05,609 INFO L225 Difference]: With dead ends: 850 [2021-01-06 11:39:05,609 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 11:39:05,611 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:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 11:39:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2021-01-06 11:39:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 601 transitions. [2021-01-06 11:39:05,626 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 601 transitions. Word has length 87 [2021-01-06 11:39:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:05,627 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 601 transitions. [2021-01-06 11:39:05,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 601 transitions. [2021-01-06 11:39:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:39:05,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:05,629 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:05,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:39:05,629 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -929746368, now seen corresponding path program 1 times [2021-01-06 11:39:05,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:05,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520318768] [2021-01-06 11:39:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:05,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520318768] [2021-01-06 11:39:05,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:05,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:05,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253643829] [2021-01-06 11:39:05,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:05,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:05,722 INFO L87 Difference]: Start difference. First operand 408 states and 601 transitions. Second operand 4 states. [2021-01-06 11:39:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:06,220 INFO L93 Difference]: Finished difference Result 699 states and 1024 transitions. [2021-01-06 11:39:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:06,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:39:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:06,224 INFO L225 Difference]: With dead ends: 699 [2021-01-06 11:39:06,224 INFO L226 Difference]: Without dead ends: 446 [2021-01-06 11:39:06,225 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:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-01-06 11:39:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2021-01-06 11:39:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 599 transitions. [2021-01-06 11:39:06,236 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 599 transitions. Word has length 87 [2021-01-06 11:39:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:06,237 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 599 transitions. [2021-01-06 11:39:06,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 599 transitions. [2021-01-06 11:39:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:39:06,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:06,239 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:06,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:39:06,239 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1973824157, now seen corresponding path program 1 times [2021-01-06 11:39:06,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:06,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649174039] [2021-01-06 11:39:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:06,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649174039] [2021-01-06 11:39:06,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:06,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:06,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703361653] [2021-01-06 11:39:06,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:06,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:06,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:06,319 INFO L87 Difference]: Start difference. First operand 408 states and 599 transitions. Second operand 4 states. [2021-01-06 11:39:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:07,027 INFO L93 Difference]: Finished difference Result 906 states and 1332 transitions. [2021-01-06 11:39:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:07,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:39:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:07,031 INFO L225 Difference]: With dead ends: 906 [2021-01-06 11:39:07,032 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 11:39:07,033 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:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 11:39:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2021-01-06 11:39:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 597 transitions. [2021-01-06 11:39:07,046 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 597 transitions. Word has length 88 [2021-01-06 11:39:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:07,047 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 597 transitions. [2021-01-06 11:39:07,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 597 transitions. [2021-01-06 11:39:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:39:07,048 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:07,049 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:39:07,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:39:07,049 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1550177435, now seen corresponding path program 1 times [2021-01-06 11:39:07,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:07,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519154637] [2021-01-06 11:39:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:07,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519154637] [2021-01-06 11:39:07,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:07,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:07,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21710772] [2021-01-06 11:39:07,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:07,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:07,123 INFO L87 Difference]: Start difference. First operand 408 states and 597 transitions. Second operand 4 states. [2021-01-06 11:39:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:07,545 INFO L93 Difference]: Finished difference Result 826 states and 1207 transitions. [2021-01-06 11:39:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:07,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:39:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:07,548 INFO L225 Difference]: With dead ends: 826 [2021-01-06 11:39:07,549 INFO L226 Difference]: Without dead ends: 428 [2021-01-06 11:39:07,550 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:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-01-06 11:39:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2021-01-06 11:39:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2021-01-06 11:39:07,562 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 88 [2021-01-06 11:39:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:07,562 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2021-01-06 11:39:07,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2021-01-06 11:39:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:39:07,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:07,564 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:39:07,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:39:07,564 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash 114296894, now seen corresponding path program 1 times [2021-01-06 11:39:07,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:07,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155654656] [2021-01-06 11:39:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:39:07,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155654656] [2021-01-06 11:39:07,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:07,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:39:07,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891888163] [2021-01-06 11:39:07,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:39:07,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:39:07,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:39:07,644 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand 4 states. [2021-01-06 11:39:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:08,188 INFO L93 Difference]: Finished difference Result 906 states and 1324 transitions. [2021-01-06 11:39:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:39:08,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:39:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:08,194 INFO L225 Difference]: With dead ends: 906 [2021-01-06 11:39:08,194 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 11:39:08,195 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:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 11:39:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2021-01-06 11:39:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2021-01-06 11:39:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 593 transitions. [2021-01-06 11:39:08,208 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 593 transitions. Word has length 89 [2021-01-06 11:39:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:08,208 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 593 transitions. [2021-01-06 11:39:08,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:39:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 593 transitions. [2021-01-06 11:39:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:39:08,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:08,210 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:39:08,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:39:08,210 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 362443388, now seen corresponding path program 1 times [2021-01-06 11:39:08,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:08,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747993367] [2021-01-06 11:39:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 11:39:08,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747993367] [2021-01-06 11:39:08,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:08,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:08,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484230875] [2021-01-06 11:39:08,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:08,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:08,312 INFO L87 Difference]: Start difference. First operand 408 states and 593 transitions. Second operand 3 states. [2021-01-06 11:39:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:08,412 INFO L93 Difference]: Finished difference Result 806 states and 1178 transitions. [2021-01-06 11:39:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:08,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 11:39:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:08,416 INFO L225 Difference]: With dead ends: 806 [2021-01-06 11:39:08,416 INFO L226 Difference]: Without dead ends: 555 [2021-01-06 11:39:08,416 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:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-01-06 11:39:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-01-06 11:39:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2021-01-06 11:39:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2021-01-06 11:39:08,431 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 89 [2021-01-06 11:39:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:08,432 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2021-01-06 11:39:08,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2021-01-06 11:39:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:39:08,433 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:08,434 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:39:08,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:39:08,434 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 846505389, now seen corresponding path program 1 times [2021-01-06 11:39:08,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:08,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619366577] [2021-01-06 11:39:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:39:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-06 11:39:08,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619366577] [2021-01-06 11:39:08,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:39:08,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:39:08,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643120550] [2021-01-06 11:39:08,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:39:08,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:39:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:39:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:39:08,510 INFO L87 Difference]: Start difference. First operand 555 states and 805 transitions. Second operand 3 states. [2021-01-06 11:39:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:39:08,555 INFO L93 Difference]: Finished difference Result 1102 states and 1605 transitions. [2021-01-06 11:39:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:39:08,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 11:39:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:39:08,559 INFO L225 Difference]: With dead ends: 1102 [2021-01-06 11:39:08,560 INFO L226 Difference]: Without dead ends: 704 [2021-01-06 11:39:08,560 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:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-01-06 11:39:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-01-06 11:39:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2021-01-06 11:39:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1023 transitions. [2021-01-06 11:39:08,580 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1023 transitions. Word has length 91 [2021-01-06 11:39:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:39:08,580 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 1023 transitions. [2021-01-06 11:39:08,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:39:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1023 transitions. [2021-01-06 11:39:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 11:39:08,583 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:39:08,583 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:39:08,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:39:08,583 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:39:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:39:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2021-01-06 11:39:08,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:39:08,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877835405] [2021-01-06 11:39:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:39:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:39:08,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:39:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:39:09,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:39:09,123 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:39:09,123 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:39:09,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:39:09,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:39:09 BoogieIcfgContainer [2021-01-06 11:39:09,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:39:09,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:39:09,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:39:09,263 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:39:09,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:54" (3/4) ... [2021-01-06 11:39:09,267 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:39:09,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:39:09,269 INFO L168 Benchmark]: Toolchain (without parser) took 17245.03 ms. Allocated memory was 158.3 MB in the beginning and 309.3 MB in the end (delta: 151.0 MB). Free memory was 132.2 MB in the beginning and 147.1 MB in the end (delta: -14.8 MB). Peak memory consumption was 137.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:09,269 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 158.3 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:39:09,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 926.53 ms. Allocated memory is still 158.3 MB. Free memory was 132.0 MB in the beginning and 135.9 MB in the end (delta: -3.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:09,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.99 ms. Allocated memory is still 158.3 MB. Free memory was 135.9 MB in the beginning and 131.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:09,271 INFO L168 Benchmark]: Boogie Preprocessor took 115.26 ms. Allocated memory is still 158.3 MB. Free memory was 131.7 MB in the beginning and 124.9 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:09,271 INFO L168 Benchmark]: RCFGBuilder took 1251.83 ms. Allocated memory was 158.3 MB in the beginning and 223.3 MB in the end (delta: 65.0 MB). Free memory was 124.9 MB in the beginning and 190.4 MB in the end (delta: -65.5 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:09,272 INFO L168 Benchmark]: TraceAbstraction took 14830.53 ms. Allocated memory was 223.3 MB in the beginning and 309.3 MB in the end (delta: 86.0 MB). Free memory was 189.9 MB in the beginning and 147.6 MB in the end (delta: 42.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:39:09,272 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 309.3 MB. Free memory is still 147.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:39:09,275 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.16 ms. Allocated memory is still 158.3 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 926.53 ms. Allocated memory is still 158.3 MB. Free memory was 132.0 MB in the beginning and 135.9 MB in the end (delta: -3.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 101.99 ms. Allocated memory is still 158.3 MB. Free memory was 135.9 MB in the beginning and 131.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 115.26 ms. Allocated memory is still 158.3 MB. Free memory was 131.7 MB in the beginning and 124.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1251.83 ms. Allocated memory was 158.3 MB in the beginning and 223.3 MB in the end (delta: 65.0 MB). Free memory was 124.9 MB in the beginning and 190.4 MB in the end (delta: -65.5 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14830.53 ms. Allocated memory was 223.3 MB in the beginning and 309.3 MB in the end (delta: 86.0 MB). Free memory was 189.9 MB in the beginning and 147.6 MB in the end (delta: 42.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 8.0 GB. * Witness Printer took 4.58 ms. Allocated memory is still 309.3 MB. Free memory is still 147.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: 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 1334. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={5:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf ; [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 = __VERIFIER_nondet_int() ; [L1098] int tmp___8 = __VERIFIER_nondet_int() ; [L1099] long tmp___9 = __VERIFIER_nondet_long() ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={5:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={5:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={5:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={5:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={5:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={5:0}] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [init=1, SSLv3_client_data={5:0}] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [init=1, SSLv3_client_data={5:0}] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [init=1, SSLv3_client_data={5:0}] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [init=1, SSLv3_client_data={5:0}] [L1330] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={5:0}] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [init=1, SSLv3_client_data={5:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={5:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={5:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={5:0}] [L1643] reach_error() VAL [init=1, SSLv3_client_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5056 SDtfs, 1779 SDslu, 6315 SDs, 0 SdLazy, 3604 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=704occurred in iteration=23, 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, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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...